in recent years, routing has been the most focused area in ad hoc networks research. on-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. most proposed on-demand routing protocols are built and relied on single route for each data session. whenever there is a link disconnection on the active ro...

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....

The constructions really rely on the ability to direct packets along specific paths. The source routing assumption is huge, and threatens to make the work irrelevant from a practical standpoint. It is not clear why explicit routing is allowed but paths with cycles are not. In the Internet, if routers honor the loose source routing option, then cycles are possible. If they do not honor that opti...

Source-sensitive routing is a routing technique where routing decisions are made according to both the source and the destination address of a packet. This is a slight refinement of ordinary next-hop routing, as used in the Global Internet, where packets are routed according to their destination only. Source-sensitive solves a number of difficult problems in multihomed edge networks as well as ...

The routing algorithms can be classi®ed into source, distributed and hierarchical routing. Source routing algorithms are conceptually simple, but they suffer from scalability problem. Distributed routing algorithms are more scalable, but loops may occur, which make the routing to fail. Hierarchical routing has been used to cope with the scalability problems of source routing in large internetwo...