A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Connecting Network Partitions with Location-Assisted Forwarding Nodes in Mobile Ad Hoc Environments
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Distributed optimal self-organization in ad hoc wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Efficient Load-Balanced Clustering Algorithms for wireless sensor networks
Computer Communications
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In this paper, we propose a new node allocation scheme that is based on a probabilistic approach to protect a Mobile Ad Hoc Network (MANET) from partitioning. This scheme adopts the Normal Distribution for node placement and we refer to it as the Normally(N)-distributed Node Allocation Scheme(N-NAS). The proposed scheme is able to achieve high connectivity and good degree of coverage by controlling the positions of nodes in the MANET in a fully distributed way. In this scheme, a theoretical upper bound of partition probability can be derived. In addition, unlike the existing schemes, N-NAS automatically initializes node positions when the MANET is just constructed. Extensive simulations are carried out to validate the performance of our proposed scheme.