作者: Xiaoyu Chu , H. Sethu
DOI: 10.1109/GLOCOM.2011.6133917
关键词: Path (graph theory) 、 Node (networking) 、 Topology control 、 Computer science 、 Algorithm 、 Wireless 、 Network topology 、 Wireless ad hoc network 、 Distributed computing 、 Topology (electrical circuits) 、 Computer network 、 Relative neighborhood graph
摘要: Each node in a wireless multi-hop network can adjust the power at which it makes its transmissions and thus change topology of to save energy by choosing smaller number neighbors with communicates directly. The Directed Relative Neighborhood Graph (DRNG) algorithm is among most popular, efficient versatile control algorithms that reduces costs while preserving connectivity. In this paper, however, we identify two key limitations DRNG address them new power-aware distributed called Inclusive DRNG. We show cut down cost executing itself as low one-third further also generates achieves significant improvement over 25% average communication across path between any nodes realistic irregular radio environments.