In this paper we propose a delay-constrained distributed multicast routing algorithm based on token passing. This algorithm is fully distributed and generates a multicast routing tree, which not only meets the realtime requirement, but also has a sub-optimal network cost. Simulations have been done and the results have shown that the multicast routing tree generated by our algorithm has better ...

A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many routing schemes proposed in the literature try to minimize the energy consumed in routing or maximize the lifetime of the sensor network without taking into consideration limited bandwidth of wireless links. This can ...

With the recognition of ad-hoc networks, several routing protocols are designed for route discovery and also the route maintenance. Because mobile ad-hoc networks differs from the traditional wired networks. They have certain unique characteristics which can cause difficulties for providing QoS in such networks. The unique characteristics are dynamically varying network topology, lack of precis...

The rapid development of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained minimum Steiner tree problem in graphs as the underpinning mathematical model is a wellknown NP-complete problem. In this paper we investigate a GRASP (Greedy Randomized Adaptive Search Procedure) approach with VNS (Variable Neighb...

A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given quality-of-service constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a nearoptimal solution. However, these heuristics eith...

In this work we study the dynamic one-to-one communication problem in energyand capacity-constrained wireless ad-hoc networks. The performance of such networks is evaluated under random traffic generation and continuous energy recharging at the nodes over an infinite-time horizon. We are interested in the maximum throughput that can be sustained by the network with the node queues being finite ...

Multipath routing is an e cient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are especially critical in the resource constrained system such as WSNs. In this paper we provide a survey of the state-of-the-art of proposed multipath routing protocols for WSNs, which are classi ed into three categories, infrastructur...

approved: Bechir Hamdaoui Linear wireless sensor networks (L\SN) are special class of wireless sensor networks where sensor nodes are deployed in a straight line. Monitoring industrial pipelines, railroads, tunnels, power lines, and borders are applications of L\SNs. \ireless sensors are tiny devices with limited energy resources; therefore, efcient energy routing in L\SNs is critical. In this ...

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to nd low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to nd a near-optimal solution. However, these heuristics e...