LINKORD: link ordering-based data gathering protocol for wireless sensor networks

详细信息    查看全文

• 作者：Marjan Radi ; Behnam Dezfouli ; Kamalrulnizam Abu Bakar ; Shukor Abd Razak…
• 关键词：Wireless sensor networks ; Data gathering ; Link ordering ; Link quality ; Energy ; efficiency ; 68M10 ; 68M12 ; 90B18
• 刊名：Computing
• 出版年：2015
• 出版时间：March 2015
• 年：2015
• 卷：97
• 期：3
• 页码：205-236
• 全文大小：1,191 KB
• 参考文献：1. Arampatzis T, Lygeros J, Manesis S (2005) A survey of applications of wireless sensors and wireless sensor networks. In: Proceedings of the 2005 IEEE international symposium on, mediterrean conference on control and automation intelligent control, 2005, IEEE, pp 719-24
  2. Baccour N, Jamaa MB (2009) A comparative simulation study of link quality estimators in wireless sensor networks. In: IEEE international symposium on modeling, analysis & simulation of computer and telecommunication systems (MASCOTS -9), pp 1-0
  3. Baccour N, Mottola L, Niga MZ (2012) Radio link quality estimation in wireless sensor networks : a survey. ACM Trans Sens Netw 8(4):35 CrossRef
  4. Borges VC, Curado M, Monteiro E (2011) Cross-layer routing metrics for mesh networks: current status and research directions. Comput Commun 34(6):681-03 CrossRef
  5. Burri N, Rickenbach PV (2007) Dozer: ultra-low power data gathering in sensor networks. In: Proceedings of the 6th international conference on information processing in sensor networks (IPSN -7), pp 450-59
  6. Cerpa A, Wong JL, Potkonjak M, Estrin D (2005) Temporal properties of low power wireless links: modeling and implications on multi-hop routing. In: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc -5)
  7. Colesanti U, Santini S (2011) The collection tree protocol for the castalia wireless sensor networks simulator. Tech. rep., No 729, Department of Computer Science, ETH Zurich, Zurich, Switzerland
  8. Couto DSJD, Aguayo D, Bicket J, Morris R (2003) A high-throughput path metric for multi-hop wireless routing. ACM Mobicom Conf. ACM, San Diego, pp 134-46
  9. Das S, Pucha H, Papagiannaki K (2007) Studying wireless routing link metric dynamics. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement (IMC -7), pp 327-32
  10. Deshpande V, Sarode P, Sarode S (2010) Root cause analysis of congestion in wireless sensor network. Int J Comput Appl 1(18):31-4
  11. Dezfouli B, Radi M, Razak SA, Whitehouse K, Bakar KA, Hwee-pink T (2014) Improving broadcast reliability for neighbor discovery, link estimation and collection tree construction in wireless sensor networks. Comp Netw 62:101-21
  12. Dezfouli B, Radi M, Razak SA, Bakar KA, Hwee-pink T (2014) Modeling low-power wireless communications. J Comp Netw Appl 1-1. doi:10.1016/j.jnca.2014.02.009
  13. Draves R, Zill B, Padhye J (2004) Comparison of routing metrics for static multi-hop wireless networks. In: Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications, ACM, pp 133-44
  14. England D, Veeravalli B (2007) A robust spanning tree topology for data collection and dissemination in distributed environments. IEEE Trans Parallel Distrib 18(5):608-20 CrossRef
  15. Ww Fang, Jm Chen, Ts Chu, Dp Qian (2009) Congestion avoidance, detection and alleviation in wireless sensor networks. J Zhejiang Univ Sci C 11(1):63-3
  16. Fonseca R, Gnawali O, Jamieson K, Kim S, Levis P, Woo A (2006) The collection tree protocol (CTP). Tech. rep., TEP 123, TinyOS Network Working Group
  17. Ganesan D, Krishnamachari B, Woo A, Culler D (2002) Complex behavior at scale: an experimental study of low-power wireless sensor networks. Tech. rep., UCLA/CSD-TR 02-013, Computer Science Department, UCLA
  18. García-hernández CF, Ibargüengoytia-gonzález PH, García-hernández J, Pérez-díaz JA (2007) Wireless sensor networks and applications: a survey. Int J Comput Sci Netw Secur 7(3):264-73
  19. Gilbert EEPK, Baskaran K (2012) Research issues in wireless sensor network applications: a survey. Int J Inf Electron Eng 2(5):702-06
  20. Gnawali O, Jamieson K, Levis P, Fonseca R (2007) Four-bit wireless link estimation. In. In Proceedings of the 6th workshop on hot topics in networks (HotNets -6), In sixth workshop on hot topics in networks (HotNets)
  21. Gnawali O, Fonseca R, Jamieson K (2009) Collection tree protocol. In: Proceedings of the 7th ACM conference on embedded networked sensor systems (SenSys -9)
  22. Heidemann J, Estrin D (2007) Centralized routing for resource-constrained wireless sensor networks. Tech. Rep , August, UCLA, Los Angeles, CA, USA
  23. Jakllari G, Eidenbenz S (2012) Link positions matter : a noncommutative routing metric for wireless mesh networks. IEEE Trans Mobile Comput 11(1):61-2 CrossRef
  24. Kim
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Computational Mathematics and Numerical Analysis
  
• 出版者：Springer Wien
• ISSN：1436-5057

文摘

With respect to the multi-hop communication pattern of wireless sensor networks, all the nodes should establish multi-hop paths towards a common data gathering point to provide a data gathering service for the underlying applications. Although data gathering protocols provide a simple service, these protocols suffer from poor performance in practice due to the power constraints of low-power sensor nodes and unreliability of wireless links. Existing data gathering protocols rely on the ETX metric to find high-throughput paths through assuming there is an infinite number of transmission attempts at the link layer for delivering a single packet over every link. However, in practice the link layer provides a bounded number of transmissions per packet over individual links. Therefore, employing existing data gathering protocols in these situations may result in the construction of the paths that require more than maximum number of provided link layer transmissions for delivering a single packet over each link. In this regard, we propose a path cost function which considers the limitation on the number of provided link layer transmissions and relative position of the links along the paths according to their data transmission probability. Furthermore, we introduce a data gathering protocol which uses the proposed path cost function to construct high-throughput paths. Moreover, this protocol employs a newly designed congestion control mechanism during the data transmission process to provide energy-efficient and high-throughput data delivery. The simulation results show that, the proposed protocol improves data delivery ratio by 70?% and network goodput by 80?%, while it reduces the consumed energy for data delivery by 50?% compared to the default data gathering protocol of TinyOS.