eprintid: 2377
rev_number: 10
eprint_status: archive
userid: 274
dir: disk0/00/00/23/77
datestamp: 2016-12-29 12:12:33
lastmod: 2016-12-29 12:12:33
status_changed: 2016-12-29 12:12:33
type: conference_item
metadata_visibility: show
creators_name: Le, Dinh Thanh
creators_name: Nguyen, Dai Tho
creators_id: thanhld@vnu.edu.vn
creators_id: nguyendaitho@vnu.edu.vn
corp_creators: University of Engineering and Technology, Vietnam National University, Hanoi
title: Greedy Geographic Routing with Path Optimization in Wireless Sensor Networks
ispublished: pub
subjects: Communications
subjects: ECE
subjects: IT
divisions: fac_fit
abstract: In this paper, we propose Greedy with Path Optimization Routing (GPOR), a novel geographic routing protocol for wireless sensor networks. GPOR finds initial routing paths by following a greedy with recovery strategy, then uses a follow-up technique to optimize the paths. An attempt is also made to create routing entries applicable to destination areas rather than individual nodes. Main advantages of GPOR are path optimization and void avoidance capacities. We implement GPOR in ns-2 and present simulation results.
date: 2010
date_type: published
contact_email: thanhld@vnu.edu.vn
full_text_status: public
pres_type: paper
pagerange: 148-153
event_title: 2010 IEEE-RIVF International Conference on Computing and Communication Technologies
event_location: Hanoi, Vietnam
event_dates: November 1-4, 2010
event_type: conference
refereed: TRUE
referencetext: [1] G. G. Finn, “Routing and addressing problems in large
metropolitan-scale internetwork,” Tech. Rep. ISI/RR-87-180, Information Sciences Institute, Mar. 1987.
[2] B. Karp and H.T. Kung, “GPSR: Greedy perimeter stateless routing for wireless sensor networks,” Proc. of Mobicom, pp. 243-254, 2000.
[3] S. Datta, I. Stojmenovic, J. Wu, “Internal node and shortcut based routing with guaranteed delivery in wireless networks,” Proc. of the IEEE International Conference on Distributed Computing and Systems, pp. 461-466, 2001.
[4] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with guaranteed delivery in ad hoc wireless networks,” Wireless Networks, 7(6):609-616, 2001.
[5] F. Kuhn, R.Wattenhofer, A. Zollinger, “Asymptotically optimal geometric mobile ad-hoc routing,” Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Atlanta, Georgia, USA, pp. 24-33, 2002.
[6] F. Kuhn, R.Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric ad-hoc routing: Of theory and practice,” Proc. of PODC 2003, pp. 63-72, July 2003.
[7] B. Leong, S. Mitra, and B. Liskov, “Path vector face routing: Geographic routing with local face information,” Proc. of ICNP, pp. 147-158, 2005.
[8] Q. Fang, J. Gao, and L. Guibas, “Locating and bypassing routing holes in sensor networks,” Mobile Networks and Applications, 11(2): 187-200, April 2006.
[9] The Network Simulator – ns-2. [Online]. Available:
http://www.isi.edu/nsnam.
[10] I. Stojmenovic, X. Lin, “Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 12, pp. 1023-1032, Oct. 2001.
[11] R. Jain, A. Puri, R. Sengupta, “Geographical routing using partial information in wireless ad hoc networks,” IEEE Personal Communications, pp. 48-57, Feb. 2001.
[12] Zheng Guping, Wang Yu, “Advance detour strategy for
geographic routing in wireless sensor networks,” 2009
International Forum on Information Technology and Applications, pp. 296-299, 2009.
[13] S. Nikoletseas and O. Powell, “Simple and efficient geographic routing around obstacles for wireless sensor networks,” Proc. of the 6th Workshop on Efficient and Experimental Algorithms, LNCS, Splinger-Verlag, pp. 161-174, 2007.
[14] L. Moraru, P. Leone, S. Nikoletseas, J. D. P. Rolim, “Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms,” Proc. of the 3rd ACM workshop on QoS and security for wireless and mobile networks, pp. 31-38, 2007.
[15] F. Huc, A. Jarry, P. Leone, L. Moraru, S. Nikoletseas and J. Rolim, “Early obstacle detection and avoidance for all to all traffic pattern in wireless sensor networks,” ALGOSENSORS 2009, LNCS 5804, pp. 102–115, 2009.
[16] A. Koutsopoulos, S. Nikoletseas, J. D. P. Rolim, “Near-optimal data propagation by efficiently advertising obstacle boundaries,” Proc. of the 6th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, pp. 15-22, 2009.
citation:   Le, Dinh Thanh and Nguyen, Dai Tho  (2010) Greedy Geographic Routing with Path Optimization in Wireless Sensor Networks.  In: 2010 IEEE-RIVF International Conference on Computing and Communication Technologies, November 1-4, 2010, Hanoi, Vietnam.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2377/1/ThanhLeDinh_DaiThoNguyen-camera-ready.pdf