Balanced Path Routing and Detection Mechanism for Wireless Sensor Networks
Keywords:
Enhanced Dijkstra’s Algorithm, Shortest path, Balanced Path routing mechanismAbstract
An Enhanced Dijkstra’s algorithm is presented in this paper. In this proposed approach, a new form of Balanced Path Routing technique is used in which the data send from source node is being transferred to the alternate node and then pass through the nodes to reach the destination. This prevents cuts in between the nodes and gives prior estimation of the shortest route path from source to destination. In Enhanced Dijkstra’s algorithm, the packet delivery ratio is maintained at 80% even when the number of nodes gets increased. This finding indicates that proposed method guarantees reliable communication in wireless sensor networks. The simulation results show the best shortest path with better transmission time.
References
X.Yuan and A. Saifee, “Path Selection Methods for Localized Quality of Service Routing”, Technical Report, TR-010801, Dept. of Computer Science, Florida State University, July, 2001.
N. Pushpalatha1, Dr.B.Anuradha2, “Shortest Path Position Estimation between Source and Destination nodes in Wireless Sensor Networks with Low Cost”, Volume 2, Issue 4, April 2012
Feng Zeng, Lan Yao ; Zhigang Chen ; Huamei Qi, “A Distributed and Shortest-Path-Based Algorithm for Maximum Cover Sets Problem in Wireless Sensor Networks”, Nov. 2011
Th. Clausen et al., “Optimized Link State Routing Protocol,” IETF Internet draft, draft ietfmanet- olsr-11.txt, July 2003.
G. Tan, M. Bertier, and A.-M. Kermarrec, “Visibility-graph-based shortest-path geographic routes in sensor networks,” in Proc. of IEEE INFOCOM, 2009.
C.-Y. Chong and S. Kumar, “Sensor networks: evolution, opportunities, and challenges,” Proceedings of the IEEE, vol. 91, no. 8, pp. 1247 – 1256, Aug. 2003.
A. Cerpa and D. Estrin, “ASCENT: Adaptive self-configuring sensor networks topologies,” IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 272–285, 2004.
Shilpa Mahajan1, Jyoteesh Malhotra, Energy Efficient Path Determination in Wireless Sensor Network Using BFS Approach”, Published Online November 2011
J. Kleinberg, M. Sandler, and A. Slivkins, “Network failure detection and graph connectivity,” in Proc. of ACM SODA, 2004.
A. Wood, J. Stankovic, G. Virone, L. Selavo, Z. He, Q. Cao, T. Doan, Y. Wu, L. Fang, and R. Stoleru, “Context-aware wireless sensor networks for assisted living and residential monitoring,” Network, IEEE, vol. 22, no. 4, pp. 26–33, 2008.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall Inc., 1993.
D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traf_c demands: understanding fundamental tradeoffs. In Proceedings of SIGCOMM'03, pages 313.324. Karlsruhe, Germany, August 2003.
D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Requirements for traf_c engineering over MPLS. IETF RFC 2702, September 1999.
Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. R¨acke. Optimal oblivious routing in polynomial time. In Proceedings of 35th STOC, pages 383. 388. San Diego, June 2003.
D. P. Bertsekas and R. G. Gallager. Data Networks (2nd Edition). Printice Hall, 1992.
S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft. Geographical and temporal characteristics of Inter-POP _ows: View from a single POP. European Transactions on Telecommunications, 13(1):5.22, February 2002.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traf_c demands for operational IP networks: methodology and experience. IEEE/ACM Transactions on Networking, 3(9):265. 279, June 2001.
B. Fortz and M. Thorup. Internet traf_c engineering by optimizing OSPF weights. In Proceedings of INFOCOM'00, pages 519.528. Tel-Aviv, Israel, March 2000.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2013 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
