By Topic

ADSR: Angle-Based Multi-hop Routing Strategy for Mobile Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kwangcheol Shin ; Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea ; Kyungjun Kim ; Soontae Kim

Though Dynamic Source Routing (DSR) is a popular on-demand algorithm designed to restrict the bandwidth consumed by control packets, the flooding of Route Request (RREQ) packets to find paths to a destination makes it difficult to apply DSR to wireless sensor networks (WSNs), which have tiny sensor nodes of limited memory and power. In this study, an angle-based multi-hop routing algorithm for mobile WSNs, which is termed ADSR, is proposed. ADSR is a variation of DSR utilizing the location information of a neighboring mobile node and a stationary sink to make the decision of dropping or rebroadcasting the RREQ packet received. ADSR focuses on reducing the number of control packets and, as a result, ADSR improves data deliveries and End-to-End delay. The experimental results using Qualnet modeler software prove that ADSR outperforms DSR in terms of overhead, data delivery, and End-to-End delay regardless of the moving speed or number of sensor nodes.

Published in:

Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific

Date of Conference:

12-15 Dec. 2011