Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыДефектологияКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем нового Логобуржца алике со вступлением в клуб!



Algorithm for A Connected Dominating Set in Wireless Networks   Mukesh Kumar Awasthi and Noor Mohammad

Algorithm for A Connected Dominating Set in Wireless Networks

80 страниц. 2013 год.
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...
- Генерация страницы: 0.05 секунд -