End-To-End Routing Analysis Through Greedy Forwarding In Sensor Networks Using Advanced Topology Aware Routing (ATAR)

G Eswara Moorthi, M Shanthi, M Mooorthi

Abstract


Greedy forwarding is a simple yet efficient technique employed by many routing protocols. It is ideal to realize point-to-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors’ information regardless of network size. A packet can be moved closer to the destination in the network topology if it is forwarded geographically closer to the destination in the physical space. This assumption, however, may lead packets to the local minimum where no neighbors of the sender are closer to the destination or low-quality routes that comprise long distance hops of low packet reception ratio.

To address the local minimum problem, a Advanced Topology Aware Routing (ATAR) protocol is proposed that efficiently encodes a network topology into a low-dimensional virtual coordinate space where hop distances between pair wise nodes are preserved. Further, it improves the routing quality by embedding a network topology based on the metric of expected transmission count (ETX). ETX embedding accurately encodes both a network’s topological structure and channel quality to nodes’ small size virtual coordinates, which helps greedy forwarding to guide a packet along the optimal path that has the fewest number of transmissions. In this paper enhanced the routing performance and improved in terms of routing success ratio and routing cost.


Keywords


Sensor Networks, Routing, ATAR, ETX, Greedy forwarding.

References


Pei Huang, Chen Wang, and Li Xiao “Improving End-to-End Routing Performance of Greedy Forwarding in Sensor Networks” IEEE Transactions on Parallel and Distributed Systems, Vol. 23, No. 3, March 2012.

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.

B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. MobiCom, 2000.

F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric Ad-Hoc Routing: Of Theory and Practice,” Proc. Ann. Symp. Principles of Distributed Computing (PODC), 2003.

H. Frey and I. Stojmenovic, “On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks,” Proc. MobiCom, pp. 390-401, 2006.

Z. Zhong and T. He, “Achieving Range-Free Localization beyond Connectivity,” Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys), 2009.

D.S.J.D. Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” Proc. MobiCom, pp. 134-146, 2003.

Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, “Geographic Routing Made Practical,” Proc. Conf. Symp. Networked Systems Design and Implementation (NSDI), vol. 2, pp. 217-230, 2005.

B. Leong, B. Liskov, and R. Morris, “Geographic Routing without Planarization,” Proc. Conf. Networked Systems Design and Implementation (NSDI), vol. 3, pp. 339-352, 2006.

ZAUMEN, W., AND GARCIA-LUNA ACEVES, J. Dynamics of distributed shortest-path routing algorithms. In Proceedings of the SIGCOMM ’91 Conference on Communications Architectures, Protocols and Applications (Sept. 1991), pp. 31–42.

PERKINS, C., AND BHAGWAT, P. Highly-dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the SIGCOMM ’94 Conference on Communications, Architectures, Protocols, and Applications (London, UK, Sept. 1994), pp. 234–244.

D.B. Johnson and D.A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile Computing, chapter 5, pages 153{181. Kluwer Academic Publishers, 1996.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

.......................................................................................................................................................................................................................

ISSN  2279 – 0381 |  IST HOMEJOURNAL HOME | Copyright IST 2012-13

.......................................................................................................................................................................................................................