International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Network Lifetime Maximization of Sensor Network Based on Energy Aware Source Tree Routing


Affiliations
1 Dept of ECE, LAEC, Bidar, Karnataka, India
2 Dept of ECE, Bhalki, Karnataka, India
 

Wireless sensor network is a wireless network of autonomous sensor nodes where objective is to acquire data from different sensor nodes called sources in a central node called base station or server or sink. Several routing techniques are proposed for sensor networks. It includes shortest path routing, gossiping, flooding and so on. But Spanning tree is considered as good topology control mechanism for sensor network. Most of the literature emphasizes on generating the tree where sink is the ischolar_main node. Such trees are called sink based tree. However sink based trees has maximum spreading. If congestion occurs at any node joining lower nodes to sink than sink cannot acquire data from nodes at lower level at tree. In order to avoid this problem, we propose a source based tree. Each of the source node generates a tree till sink. Therefore there are more than one tree present in the network and sink is connected to source through different paths. Each node upon getting a route request checks if it has maximum nodes connected to it. This list is called a MPR list. If it has maximum connectivity, it can acquire data from many nodes, aggregate them and forward it to sink. Thus our work consists of many trees from source nodes to sink where every intermediate node has maximum connectivity. Therefore the tree is most expanded. We further implement backup route creation to prevent sudden connectivity loss. Multiple paths from each source to sink ensures maximum data delivery. As power and energy loss is a major concern in such a network, we adopt an Energy aware tree creation to ascertain that all the intermediate nodes have maximum energy. Through results we prove that the proposed system performs better than sink based tree in terms of packet delivery ratio, throughput, low average energy consumption and elongated lifetime.

Keywords

Wireless Sensor Networks, Congestion Control, Source Based Trees, Sink Based Trees, OMNeT++ Software.
User
Notifications
Font Size

  • J. N. Al-karaki and A. E. Kamal, “Routing Techniques in Wireless Sensor Networks: A Survey,” IEEE Wireless Communications, vol. 11, pp. 6–28, 2004.

  • J. Kang, Y. Zhang, and B. Nath, “TARA: Topology-Aware Resource Adaptation to Alleviate Congestion in Sensor Networks,” IEEE Trans- actions on Parallel and Distributed Systems, vol. 18, no. 7, pp.

  • –931, 2007.

  • V. Vassiliou and C. Sergiou, “Performance Study of Node Placement for Congestion Control in Wireless Sensor Networks,” in New Technologies, Mobility and Security (NTMS), 2009 3rd International Conference on, dec. 2009.

  • C. Sergiou and V. Vassiliou, “Energy utilization of HTAP under specific node placements in Wireless Sensor Networks,” in European Wireless (EW), 2010, pp. 482 –87.

  • A. Woo and D. E. Culler, “A Transmission Control Scheme for Me- dia Access in Sensor Networks,” in Proceedings of the 7th annual International Conference on Mobile Computing and Networking (Mobi- Com’01).New York, NY, USA: ACM Press, 2001, pp. 221–235

  • Y. Sankarasubramaniam, O. Akan, and I. Akyildiz, “ESRT: Event-to- Sink Reliable Transport in Wireless Sensor Networks,” in MobiHoc ’03: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. New York, NY, USA: ACM, 2003, pp. 177–188.

  • C. T. Ee and R. Bajcsy, “Congestion Control and Fairness for Many-to- One Routing in Sensor Networks,” in SenSys ’04: Proceedings of the 2nd international conference on Embedded networked sensor systems. New York, NY, USA: ACM, 2004, pp. 148–161.

  • C.-Y. Wan, A. T. Campbell, and L. Krishnamurthy, “P.S.F.Q: A Reliable Transport Protocol for Wireless Sensor Networks,” in WSNA ’02: Proceedings of the 1st ACM international workshop on Wireless Sensor Networks and Applications. New York, NY, USA: ACM Press, 2002, pp. 1–11.

  • C. Sergiou, V. Vassiliou, and A. Pitsillides, “Reliable Data Transmission in Event-Based Sensor Networks During Overload Situation,” in WICON ’07: Proceedings of the 3rd International Conference on Wireless Internet, Austin, Texas, October 2007, pp. 1–8.

  • C. Sergiou and V. Vassiliou, “DAlPaS: A Performance Aware Congestion Control Algorithm in Wireless Sensor Networks,” in Telecommunica- tions (ICT), 2011 18th International Conference on, may 2011, pp. 167 –173.

  • J. Hightower and G. Borriello, “Location Systems for Ubiquitous Computing,” Computer, vol.

  • , pp. 57–66, August 2001.

  • N. Li, J. Hou, and L. Sha, “Design and Analysis of an MST-based Topol- ogy Control Algorithm,” in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, vol. 3, 2003

  • Sergiou, C.; Vassiliou, V. "Tree-forming schemes for overload control in Wireless Sensor Networks", Ad Hoc Networking Workshop (MedHoc-Net), 2012 The 11th Annual Mediterranean, On page(s): 61 – 66.


Abstract Views: 191

PDF Views: 0




  • Network Lifetime Maximization of Sensor Network Based on Energy Aware Source Tree Routing

Abstract Views: 191  |  PDF Views: 0

Authors

Shivshanker P. Biradar
Dept of ECE, LAEC, Bidar, Karnataka, India
T. S. Vishwanath
Dept of ECE, Bhalki, Karnataka, India

Abstract


Wireless sensor network is a wireless network of autonomous sensor nodes where objective is to acquire data from different sensor nodes called sources in a central node called base station or server or sink. Several routing techniques are proposed for sensor networks. It includes shortest path routing, gossiping, flooding and so on. But Spanning tree is considered as good topology control mechanism for sensor network. Most of the literature emphasizes on generating the tree where sink is the ischolar_main node. Such trees are called sink based tree. However sink based trees has maximum spreading. If congestion occurs at any node joining lower nodes to sink than sink cannot acquire data from nodes at lower level at tree. In order to avoid this problem, we propose a source based tree. Each of the source node generates a tree till sink. Therefore there are more than one tree present in the network and sink is connected to source through different paths. Each node upon getting a route request checks if it has maximum nodes connected to it. This list is called a MPR list. If it has maximum connectivity, it can acquire data from many nodes, aggregate them and forward it to sink. Thus our work consists of many trees from source nodes to sink where every intermediate node has maximum connectivity. Therefore the tree is most expanded. We further implement backup route creation to prevent sudden connectivity loss. Multiple paths from each source to sink ensures maximum data delivery. As power and energy loss is a major concern in such a network, we adopt an Energy aware tree creation to ascertain that all the intermediate nodes have maximum energy. Through results we prove that the proposed system performs better than sink based tree in terms of packet delivery ratio, throughput, low average energy consumption and elongated lifetime.

Keywords


Wireless Sensor Networks, Congestion Control, Source Based Trees, Sink Based Trees, OMNeT++ Software.

References