Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Routing in Wireless Adhoc Networks: A New Horizon (0912.4324v1)

Published 22 Dec 2009 in cs.NI

Abstract: A lot of work has been done on routing protocols for mobile ad hoc networks, but still standardization of them requires some more issues less addressed by the existing routing protocols. In this paper a new paradigm of maintaining multiple connections in adhoc routing protocols has been highlighted which may be crucial for efficient routing in mobile ad hoc networks. The problem of multiple connections has been hardly worked on in adhoc networks. In this paper the solution of route maintenance if nodes are maintaining multiple connections has been proposed. This idea not only helps to solve the multiple connections problem, but also take care of proper bandwidth distribution to different connections as per different traffic types. Study has been incorporated on existing AODV with changes. Simulation studies have been performed over packet delivery ratio, throughput and message overheads. Results show that the proposed solution for multiple connections is efficient and worth implementing in existing as well as new protocols.

Citations (4)

Summary

We haven't generated a summary for this paper yet.