摘要
This paper proposes a multi-axis projection （MAP） based giant component formation strategy via the Maximal Independent Set （MIS） in a random unit-disk graph. We focus on the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage areas of the nodes are disks with identical radii. In the simulation, we show that the MAP-based giant component has the ability to connect most nodes and serves as a backbone in the network. The algorithm is localized and may play an important role in efficiently constructing a virtual backbone for ad hoc and sensor networks.
This paper proposes a multi-axis projection （MAP） based giant component formation strategy via the Maximal Independent Set （MIS） in a random unit-disk graph. We focus on the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage areas of the nodes are disks with identical radii. In the simulation, we show that the MAP-based giant component has the ability to connect most nodes and serves as a backbone in the network. The algorithm is localized and may play an important role in efficiently constructing a virtual backbone for ad hoc and sensor networks.
基金
Supported by the National Natural Science Foundation of China(No. 60903055)
the China Postdoctoral Science Foundation Funded Project (No. 20080430776)
the National Basic Research and Development (973) Program of China (No. 2011CB302905)
