Issue No. 01 - June (2013 vol. 1)
Xiao Chen , Dept. of Comput. Sci., Texas State Univ., San Marcos, TX, USA
Zanxun Dai , Dept. of Comput. Sci., Texas State Univ., San Marcos, TX, USA
Wenzhong Li , State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China
Hongchi Shi , Dept. of Comput. Sci., Texas State Univ., San Marcos, TX, USA
In this paper, we propose performance guaranteed routing protocols in asymmetric sensor networks (ASNs) where two end nodes may not use the same path to communicate with each other. ASNs can be caused by hardware devices or environment. Different from most of the existing routing protocols in symmetric sensor networks, because of asymmetry, achieving desired routing performance in ASNs poses significant research challenges. To address these challenges, we first propose a general framework protocol called reverse path (RP) to deal with asymmetric links and then present two efficient routing algorithms LayHet and EgyHet built on RP to satisfy performance requirements. LayHet is a performance guaranteed layer-based routing protocol that embeds the shortest path information and saves energy by minimizing the number of broadcasts and the probability of forwarding. EgyHet is its energy-upgraded version that considers nodes' remaining energy. Simulation results comparing the proposed and existing protocols show that LayHet and EgyHet can reach the desired delivery rate earlier than the existing one and outperform it in terms of average hops, average packet replication overhead, and average control message overhead. In addition, as sensor energy reduces, the performance of LayHet and EgyHet eventually degrades more slowly than that of the existing one.
Routing protocols, Sensor networks, Packet loss, Wireless sensor networks, Algorithm design and analysis,routing, Asymmetric sensor networks, energy efficient, performance guarantee, reverse path
Xiao Chen, Zanxun Dai, Wenzhong Li, Hongchi Shi, "Performance Guaranteed Routing Protocols for Asymmetric Sensor Networks", IEEE Transactions on Emerging Topics in Computing, vol. 1, no. , pp. 111-120, June 2013, doi:10.1109/TETC.2013.2273888