Distributed Algorithms for Mobile Ad Hoc Networks

提案编号：CCR-9972235 PI：Jennifer Welchco-PI：Nitin Vaidya在移动的ad hoc网络中，节点仅通过无线介质进行通信，没有任何基础设施，如基站。 这样一个网络的拓扑图连接两个节点，这两个节点都在对方的通信范围内。 每当阳极移动时，拓扑结构都会改变。 这种网络对灾后恢复、偏远地区的搜索和救援以及军事行动都很有用。 本研究将为行动自组网路发展有效的分散式基元，以执行互斥、群组通讯及领导者选举。 针对这些问题的现有算法没有考虑到ad hocnetworks的所有特征，例如高度动态的拓扑结构、能耗限制和可变的传输错误率。 研究内容包括：评估adhoc网络算法的性能指标，如能量消耗和节点移动性的影响;设计有效的分布式算法，用于互斥、领导选举和组通信;基于仿真和分析技术的adhoc网络分布式算法的性能评估;概念验证原型实现的分布式黑板上的一个小的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.