On-demand software management in sensor networks using profiling techniques
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Automatic IP address configuration in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Profile-matching techniques for on-demand software management in sensor networks
EURASIP Journal on Wireless Communications and Networking
Dynamic address allocation for self-organised management and control in sensor networks
International Journal of Mobile Network Design and Innovation
An authenticated dynamic IP configuration scheme for mobile ad hoc networks
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
Computer Communications
Vehicular networks and the future of the mobile internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Name resolution by rewriting in dynamic networks of mobile entities
Rainbow of computer science
An ID based secure distributed dynamic IP configuration scheme for mobile ad hoc networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Self-configuration in MANETs: different perspectives
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
Raabta: low-cost video conferencing for the developing world
Proceedings of the 2013 ACM MobiCom workshop on Lowest cost denominator networking for universal access
Cluster-Based and Distributed IPv6 Address Configuration Scheme for a MANET
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Dynamic address assignment enables nodes in mobile ad hoc networks to obtain a routable address without the need for any explicit configuration. It provides a means for nodes to communicate without any centralized infrastructure and provides a mechanism for dynamic network membership. Recently, a considerable number of dynamic addressing protocols have been proposed. While these approaches bear some similarities to each other, they also differ in some important characteristics. To understand the benefits of these different approaches, it is necessary to test the protocols in a wide range of network conditions so that their performance and suitability can be predicted. This paper studies existing solutions by categorizing and qualitatively analyzing the scalability and other performance properties of the approaches. We also introduce a new addressing approach that provides both quick and efficient unique address assignment. We then compare selected protocols through quantitative analysis based on extensive simulations. Based on the simulation results, we point out the applicability of the protocols and offer suggestions to improve protocol performance. Copyright © 2004 John Wiley & Sons, Ltd.