Graph theory and its applications
Graph theory and its applications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Weak duplicate address detection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Flooding in wireless ad hoc networks
Computer Communications
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
This paper focuses on the derivation of the message complexity when two mobile ad hoc network (MANET) groups merge together, where the network groups already have been configured with IP addresses by using address autoconfiguration protocols (AAPs). The message complexity of the MANET group merging case (GMC) in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived respectively. In order to verify the derived bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different conflict probabilities are conducted.