Abstract
Mobile Adhoc Networks (MANETs) is a wireless infrastructure-less network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence we require energy efficient routing protocols to optimize network performance. This paper aims to develop a new routing algorithm based on the energy status of the node. In this paper, it has been proposed a new Protocol for Mobile Adhoc Networks which is expected to achieve energy efficiency and reliability. The gossiping probability of a node is determined by the throughput. Differently from other proposals no external location service support, e.g., via GPS, is not required. Rather, the throughput is estimated from the “inside” of the network using feedback factor through the node propagation to the destination and the value of gossiping probability is adaptively adjusted. This results in less energy consumption and more reliability in the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Junhai, L., Liu, X., Danxia, Y.: Research on multicast routing protocols for mobile ad-hoc networks. Elsevier, Science Direct, Computer Networks, pp. 988–997 (2007)
Xie, J., Quesada, L.G., Jiang, Y.: A Threshold-based Hybrid Routing Protocol for MANET. In: IEEE ISWCS (2007)
Hou, X., Tipper, D.: Gossip-based Sleep Protocol (GSP) for Energy Efficient Routing in Wireless Ad Hoc Networks. In: IEEE Xplore, Wireless Communications and Networking Conference, March 21-25, vol. 3, pp. 1305–1310 (2004)
Burmester, M., Van Le, T., Yasinsac, A.: Adaptive gossip protocols: managing security and redundancy in dense ad hoc networks. In: Ad Hoc Networks, April 2007, vol. 5(3), pp. 313–323. Elsevier Science Publishers, Amsterdam (2007)
Shavitt, Y., Shay, A.: Optimal Routing in Gossip Networks. IEEE Transactions on Vehicular Technology 54(4), 1473–1487 (2005)
Shi, Z., Shen, H.: Adaptive Gossip-based Routing Algorithm. In: IEEE International Conference on Performance, Computing, and Communications, pp. 323–324 (2004)
Haas, Z.J., Halpern, J.Y., Li, E.L.: Gossip-Based Ad Hoc Routing. IEEE ACM Transactions on Networking 14(3), 479–491 (2006)
Morcos, H., Matta, I., Bestavros, A.: M2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks, ACM, Technical Report BUCS-TR-2004-029, Computer Science Department, Universidad de Boston (2004)
Miller, M.J., Sengul, C., Gupta, I.: Exploring the Energy-Latency Trade-off for Broadcasts in Energy-Saving Sensor Networks. In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), June 6-10, pp. 17–26 (2005)
li, X.-Y., Moaveninejad, K., Frieder, O.: Regional Gossip Routing for Wireless Ad Hoc Networks. In: Mobile Networks and Applications, vol. 10, pp. 61–77. Kluwer Academic Publishers, Dordrecht (2005)
Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: ACM SIGCOMM Computer Communication Review, Association of Computing Machinery Publishers, vol. 24(4), pp. 234–244 (1994)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Mobile Computing. ch. 5, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)
Perkins, C.E., Bhagwat, P.: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. In: ACM SIGCOMM Computer Communication Review, vol. 24(4), pp. 234–244 (October 1994)
Perkins, C.E., Royer, E.M.: Ad-hoc On-Demand Distance Vector Routing. In: WMCSA Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, pp. 90–100. IEEE Computer Society Publishers, Los Alamitos (February1999)
Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). In: Network Working Group, Proceedings of the IEEE INMIC, Pakistan (October 2001)
Park, V.D., Scott Corson, M.: A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In: INFOCOM (Proceedings of the INFOCOM 1997). Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, p. 1405. IEEE Computer Society Publishers, Los Alamitos (1997)
Beraldi, R.: The polarized gossip protocol for path discovery in MANETs. Ad Hoc Networks 6(1), 79–91 (2008)
Huang, Y., Handurukande, S., Bhatti, S.: Autonomic MANET Routing Protocols. Journal of Networks 4(8), 743–753 (2009)
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information’. In: MobiCom 2003, San Diego, California, USA, September 14–19 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajeswari, S., Venkataramani, Y. (2011). A New Routing Protocol for Mobile Ad Hoc Networks. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. CCSIT 2011. Communications in Computer and Information Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17857-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-17857-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17856-6
Online ISBN: 978-3-642-17857-3
eBook Packages: Computer ScienceComputer Science (R0)