Abstract
As an extension of our previous designed Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm in wireless sensor networks (WSNs), this paper proposes a new 2-hop geographic greedy forwarding algorithm called TPGFPlus, which uses 2-hop neighborhood information for geographic routing. In our TPGFPlus, a forwarding node selects its next-hop node which is closest to the based station among all its 1-hop and 2-hop neighbor nodes. Moreover, to prolong network lifetime, not all the nodes are awake for working in our work since the EC-CKN algorithm is applied to make the network be duty-cycled. We evaluate the performance of our algorithm versus running existing TPGF algorithm on the same duty-cycled WSNs. Simulations show that our proposed algorithm outperforms previous work TPGF on finding more average paths and shorter average length of paths, yet without causing additional energy consumption.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Leong, B., Liskov, B., Morris, R.: Geographic routing without planarization. In: Proceedings of NSDI (2006)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: ACM MobiCom, pp. 243–254 (2000)
Kim, Y.J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proc. NSDI, pp. 217–230 (2005)
Bisnik, N., Abouzeid, A.A.: Capacity deficit in mobile wireless ad hoc networks due to geographic routing overheads. In: Proceedings IEEE INFOCOM, pp. 517–525 (2007)
Lai, S., Ravindran, B.: On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks. In: Rajaraman, R., Moscibroda, T., Dunkels, A., Scaglione, A. (eds.) DCOSS 2010. LNCS, vol. 6131, pp. 158–171. Springer, Heidelberg (2010)
Calinescu, G.: Computing 2-hop neighborhoods in ad hoc wireless networks. In: Pierre, S., Barbeau, M., An, H.-C. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 175–186. Springer, Heidelberg (2003)
Lee, S., Bhattacharjee, B., Banerjee, S.: Efficient geographic routing in multihop wireless networks. In: Proc. ACM MobiHoc, pp. 230–241 (2005)
Ammari, H.M., Das, S.K.: Joint k-coverage, duty-cycling, and geographic forwarding in wireless sensor networks. In: IEEE Symposium on Computers and Communications, Sousse, Tunisia, July 5-8, pp. 487–492 (2009)
Shu, L., Zhang, Y., Yang, L.T., Wang, Y., Hauswirth, M., Xiong, N.: Tpgf: geographic routing in wireless multimedia sensor networks. Telecommunication Systems 44(1-2), 79–95 (2009)
Stojmenovic, I., Lin, X.: Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems 12, 1023–1032 (2001)
Dutta, P., Grimmer, M., Arora, A., Bibyk, S., Culler, D.: Design of a wireless sensor network platform for detecting rare, random, and ephemeral events. In: ACM/IEEE IPSN (2005)
Shu, L., Yuan, Z., Hara, T., Wang, L., Zhang, Y.: Impacts of duty-cycle on TPGF geographical multipath routing in wireless sensor networks. In: The 18th International Workshop on Quality of Service (IWQoS 2010), Beijing, China, June 16-18 (2010)
Yuan, Z., Wang, L., Shu, L., Hara, T., Qin, Z.: A Balanced Energy Consumption Sleep Scheduling Algorithm in Wireless Sensor Networks. In: Proceedings of the 7th International Wireless Communications & Mobile Computing Conference (IWCMC 2011), Istanbul, Turkey, July 5-8 (2011)
Nath, S., Gibbons, P.B.: Communicating via fireflies: geographic routing on duty-cycled sensors. In: Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN 2007), Cambridge, Massachusetts, USA, April 25-27 (2007)
Wang, X., Zhang, X., Zhang, Q., Chen, G.: An Energy-Efficient Integrated MAC and Routing Protocol for Wireless Sensor Networks. In: Proceedings of the 2009 IEEE international Conference on Communications, June 14-18, pp. 1–6 (2009)
Biswas, S., Morris, R.: ExOR: Opportunistic multi-hop routing for wireless networks. In: Proc ACM SIGCOMM 2005 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 133–143 (2005)
Zorzi, M., Member, S., Rao, R.R., Member, S.: Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multi-hop Performance. IEEE Transactions on Mobile Computing 2, 337–348 (2003)
Tarique, M., Tepe, K.E., Adibi, S., Erfani, S.: Survey of multipath routing protocols for mobile ad hoc networks. Journal of Network and Computer Applications (2009)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing. Kluwer Academic Publishers, Dordrecht (1996)
Perkins, C.E., Belding-Royer, E.M., Das, S.: Ad hoc on demand distance vector (AODV) routing. IETF RFC 3561
Shu, L., Zhang, Y., Yu, Z., Yang, L.T., Hauswirth, M., Xiong, N.: Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks. Supercomput., 94–121 (2010)
Shu, L., Wu, C., Zhang, Y., Chen, J., Wang, L., Hauswirth, M.: NetTopo: beyond simulator and visualizer for wireless sensor networks. ACM SIGBED Review 5(3) (October 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Dong, Y., Han, G., Shu, L., Guo, H., Zhu, C. (2013). Two-Hop Geographic Multipath Routing in Duty-cycled Wireless Sensor Networks. In: Qian, H., Kang, K. (eds) Wireless Internet. WICON 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41773-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-41773-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41772-6
Online ISBN: 978-3-642-41773-3
eBook Packages: Computer ScienceComputer Science (R0)