Книга: Mukesh Kumar Awasthi and Noor Mohammad «Algorithm for A Connected Dominating Set in Wireless Networks»
Производитель: "LAP Lambert Academic Publishing" A wireless adhoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. The wireless networks face challenges to form an optimal routing protocol. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Routing based on a connected dominating set is a Efficient approach, where the searching space for a route is reduced to nodes in the set, The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. In this book, we propose a simple and efficient distributed algorithm for calculating connected dominating set in adhoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the adhoc wireless network changes dynamically. The simulation results show that the average... ISBN:9783659347238 Издательство: "LAP Lambert Academic Publishing" (2013)
ISBN: 9783659347238 |
См. также в других словарях:
Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic … Wikipedia
Wireless-Fidelity — Wi Fi Le logo Wi Fi Pile de protocoles 7 • … Wikipédia en Français
Wireless fidelity — Wi Fi Le logo Wi Fi Pile de protocoles 7 • … Wikipédia en Français
Internet sans fil — Wi Fi Le logo Wi Fi Pile de protocoles 7 • … Wikipédia en Français
WI-Fi — Le logo Wi Fi Pile de protocoles 7 • … Wikipédia en Français
WIFI — Wi Fi Le logo Wi Fi Pile de protocoles 7 • … Wikipédia en Français