26 May 2005 A geographical multi-hop routing protocol for street-based networks
Author Affiliations +
Abstract
Wireless sensor networks have become a viable solution to automating and enhancing some applications. One such application is monitoring street lamps in a city. This paper introduces a routing algorithm for sensors attached to street lamps on the roads of the city. Since this network will reside along man-made roads, the physical layout of the network is restricted and static. In general, the algorithm routes packets from junction to junction until the packet reaches the intended street/avenue. Once the packet reaches the street/avenue on which the destination lies, the nodes route the packet in the direction of the specific destination node. The three main goals of this algorithm are fault-tolerance, reliability, and minimal energy. The results of two test scenarios are presented for a faultless network and a faulty network respectively. For faultless networks, the algorithm was able to achieve near-optimal routing paths from source nodes to destination nodes. In addition, the algorithm is adaptive and robust enough to insure packet delivery to its destination in marginally faulty networks. Hence, the results show that this algorithm is close to fulfilling all three of these goals.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lawrence E. LeBlanc, Lawrence E. LeBlanc, Xin-Ming Huang, Xin-Ming Huang, Jing Ma, Jing Ma, } "A geographical multi-hop routing protocol for street-based networks", Proc. SPIE 5820, Defense Transformation and Network-Centric Systems, (26 May 2005); doi: 10.1117/12.604252; https://doi.org/10.1117/12.604252
PROCEEDINGS
9 PAGES


SHARE
Back to Top