An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Improving Connectivity ofWireless Ad Hoc Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Networking Wireless Sensors
Connectivity and Topology Control in Wireless Ad Hoc Networks with Realistic Physical Layer
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
The design space of wireless sensor networks
IEEE Wireless Communications
IEEE Communications Magazine
Review: A survey on routing techniques in underwater wireless sensor networks
Journal of Network and Computer Applications
Quantifying connectivity in wireless sensor networks with grid-based deployments
Journal of Network and Computer Applications
Hi-index | 0.00 |
In this paper, a 2-D geometric and adaptive relay node deployment method with polynomial-time complexity is proposed to reduce relay nodes for bridging all disconnected node pairs of a wireless sensor network (WSN). In this method, proper locations for placing relay nodes are discovered on a plane, which gives a much larger degree of freedom to compare with the traditional 1-D search algorithm. In this way, the deployed relay node can bridge as many disconnected node pairs as possible around it. Besides, the method can also adapt to radio environments because that a sophisticated propagation model including large-scale path loss, shadowing, and multipath fading effects is used to estimate link connectivity. Simulation result validates its robustness and efficiency compared with the existing relay node deployment methods. The proposed method significantly reduces the total number of relay nodes compared with the related works in all of the investigated indoor environments.