Existing distributed delay constrained multicastrouting algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction phase or durin...
详细信息
Existing distributed delay constrained multicastrouting algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction phase or during an on-going multicast session. This article proposes an efficient distributed delay constrained multicastrouting algorithm that constructs a multicast tree in a concurrent fashion by taking advantage of the concurrency in the underlying distributed computation. The proposed algorithm has a message complexity of O(mn) and time complexity of O(n) in the worst case, where m is the number of destinations and n is the number of nodes in the network. It constructs multicast trees with the same tree costs as the ones constructed by well-known algorithms such as DKPP and DSHP while utilizing 409 to 1734 times fewer messages and 56 to 364 times less time than these algorithms under comparable success rate ratios. The proposed algorithm has been augmented with a fault recovery mechanism that efficiently constructs a multicast tree when failures occur during the tree construction phase and recovers from any failure in the multicast tree during an on-going multicast session without interrupting the running traffic on the unaffected portion of the free. (c) 2005 Wiley Periodicals, Inc.
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicastrouting （BCMR） protocol for wireless ad hoc networks is proposed. With th...
详细信息
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicastrouting （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.
A distributed QoS (quality of service) -aware source-specific multicastrouting protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicas...
详细信息
A distributed QoS (quality of service) -aware source-specific multicastrouting protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicastrouting. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributedrouting operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.
Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. routing protocols act as an interface ...
详细信息
Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree-based multicastrouting in wireless sensor networks with varying network metrics. Geographic multicastrouting (GMR) and its variations are used extensively in sensor networks. multicastrouting protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink-initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicastrouting protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributedmulticast applications. Copyright (c) 2012 John Wiley & Sons, Ltd.
暂无评论