Assigning labels in an unknown anonymous network with a leader
Distributed Computing
Weak duplicate address detection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed Operating Systems: The Logical Design
Distributed Operating Systems: The Logical Design
Autoconfiguration for IP Networking: Enabling Local Communication
IEEE Internet Computing
A Linear Fault-Tolerant Naming Algorithm
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
A study of dynamic addressing techniques in mobile ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue: Scalability Issues in Wireless Networks—Architectures, Protocols and Services
A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Conflict Free Address Allocation Mechanism for Mobile Ad Hoc Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Cluster-Based Autoconfiguration for Mobile Ad hoc Networks
Wireless Personal Communications: An International Journal
An address autoconfiguration protocol for IPv6 hosts in a mobile ad hoc network
Computer Communications
A survey of addressing algorithms for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
| Hi-index | 0.00 |
In link-free networks of communicating entities in motion like mobile ad hoc networks there is no central authority for naming and communications management. The set-up of new nodes is managed by autoconfiguration, using so-called zero configuration protocols. These protocols tend not to scale very easily and have difficulty with network partitioning and merging. We propose a number of techniques for assigning unique identifiers to entities in zero configuration protocols that are more flexible and yet lead to name extensions of smallest possible length, assuming that the entities in motion mix sufficiently. The methods use simple rewrite rules, viewing names as words over a finite alphabet.