We propose Adaptive Geo-Source Multicast Routing (AGSMR) for WSNs. It addresses the scalability issue of previous location based stateless multicast protocols in WSNs. AGSMR is a novel stateless multicast protocol that optimizes the location-based and source-based multicast approaches in various ways. First, it saves the cost of a tree building by using receiver’s geographic location informatio...

Routing and related resource allocation issues present special challenges in ad hoc networks. Typically, every node in an ad hoc network serves as a router for other nodes, and paths from source to destination often require multiple hops. Compared to wired networks, wireless ad hoc networks have less bandwidth, longer paths, and less stable connectivity, all of which render routing protocols fr...

The specific features of mobile ad hoc networks (MANETs) impose new requirements for routing protocols. The aim of this paper is to present an approach that enhances routing performance by integrating ad hoc related characteristics. We propose a loop-free adaptive path energy conserving scheme which attempts to minimize both routing and storage overhead in order to efficiently provide robustnes...

Packets transmitting in real communication networks such as the Internet can be classified as time-sensitive or time-insensitive. To better support the real-time and time-insensitive applications, we propose a two-level flow traffic model in which packets are labeled as level-1 or level-2, and those with level-1 have higher priority to be transmitted. In order to enhance the traffic capacity of...

In this letter, we propose an energy-aware source routing protocol for maximizing the network lifetime in mobile ad hoc networks. We define a new routing cost by considering both transmit and receive power consumption and remaining battery level in each node simultaneously and present an efficient route discovery procedure to investigate the proposed routing cost. Intensive simulation verifies ...

On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken...

In this paper, we have proposed a group dynamic source routing protocol, GDSR, for mobile ad hoc networks with high mobility. We focus on pursuing routing stability and making a fast recovery of link failure. Nodes in a network are divided into clusters, each being assigned a unique cluster I abel. A routing path is represented by a source route including a sequence of cluster labels, and the n...

In this work we suggest algorithms that increase the reservation success probability for bursty traac in high speed networks by adding exibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the ...

This work presents a power-efficient route discovery protocol (PERDP) to reduce signaling overhead of the power-efficient routing (PER) mechanism for Opportunity Driven Multiple Access (ODMA) networks. An analytical method was proposed to derive the control parameters to achieve a given connectivity probability. Simulation results demonstrate the accuracy of the analysis and the superiority of ...

Dynamic Source Routing protocol (DSR) has been accepted itself as one of the distinguished and dominant routing protocols for Mobile Ad Hoc Networks (MANETs). From various performance analysis and results, it is shown that DSR has been an outstanding routing protocol that outperforms consistently than any other routing protocols. But it could not pervade the same place when the performance was ...