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 ...

In large-scale wireless sensor networks, in order to support group mobility of mobile sinks, this letter proposes a novel strategy for energy-efficient and robust data dissemination to the sinks based on cluster-based communication. The novel strategy is composed of two major mechanisms for reduction of structure construction overhead and routing state maintenance overhead: 1) a virtual infrast...

We study the problem of reducing the data overhead of mesh-based multicast ad hoc routing protocols while maintaining high packet delivery ratios. Our proposed approach adaptively controls the redundancy added by the routing protocol to the minimal data overhead multicast mesh. We show that the problem of finding the minimal data overhead multicast mesh is NP-complete, and we offer a heuristic ...

Wireless sensor networks (WSN) are used to monitor physical or environmental conditions like temperature, sound, pressure, etc. Due to the monitoring process, it requires more energy and power. But the major drawback is energy consumption and it is difficult to maintain the energy level of each sensor node. To overcome these issues, proposed a new algorithm called SSNC (smart sensor network Usi...

In this work we suggest algorithms that increase the reservation success probability for bursty traffic in high speed networks by adding flexibility 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, ...

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 ...

Mobile Ad-Hoc network is a distributed wireless that self-organized and self-maintained it doesn’t require fixed framework or central administration. Wireless nodes in mobile ad hoc are transient have short lifespan. They combine to form self-configured, infrastructure-free where routing significant difficulty. The the must synchronize order decide connectivity routing. Ad synchronization inclu...

Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. In cluster or hierarchical structure local connectivity knowledge of mobile nodes is necessary for the formation and maintenance of cluster....

Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance t...

A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is quantified in terms of both message overhead and update time for non-predictive routing. This bestcase model of existing routing performance is compared with p...