Distributed Algorithms for Mobile Ad Hoc Networks

提案号：CCR-9972235PI: Jennifer Welchco-PI: Nitin vaidy在移动自组织网络中，节点仅通过无线媒介进行通信，而不需要任何基础设施，如基站。这种网络的拓扑图连接了彼此通信范围内的两个节点。当阳极移动时，拓扑结构可以改变。这种网络在灾难恢复、偏远地区的搜索和救援以及军事行动中都很有用。提出的研究将为移动自组织网络开发高效的分布式原语，以执行互斥，组通信和领导者选举。针对这些问题的现有算法并没有考虑到ad hoc网络的所有特征，例如高度动态的拓扑结构、对能量消耗的限制和可变的传输错误率。提议的研究将涉及评估自组织网络算法的适当性能指标的表征，例如能耗和节点移动性的影响；互斥、leader选举和群组通信的高效分布式算法设计基于仿真和分析技术的AD hoc网络分布式算法性能评估分布式黑板的概念验证原型实现在由无线笔记本电脑组成的小型AD hoc网络上。

Proposal Number: CCR-9972235PI: Jennifer Welchco-PI: Nitin VaidyaIn a mobile ad hoc network, nodes communicate solely via a wirelessmedium, without any infrastructure such as base stations. Thetopology graph of such a network connects two nodes that are withineach other's communication range. The topology can change whenever anode moves. Such networks are useful for disaster recovery,search-and-rescue in remote areas, and military operations. Theproposed research will develop efficient distributed primitives formobile ad hoc networks, to perform mutual exclusion, groupcommunication, and leader election. Existing algorithms for theseproblems do not take into account all characteristics of ad hocnetworks, such as highly dynamic topology, constraints on energyconsumption, and variable transmission error rates. The proposedresearch will involve characterization of appropriate performancemetrics for evaluating algorithms on ad hoc networks, such as energyconsumption and impact of node mobility; design of efficientdistributed algorithms for mutual exclusion, leader election, andgroup communication; performance evaluation of distributed algorithmsfor ad hoc networks, based on simulations and analytical techniques;proof-of-concept prototype implementation of a distributed blackboardon a small ad hoc network consisting of wireless laptops.