The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
New Self-Routing Permutation Networks
IEEE Transactions on Computers
An end-to-end approach to host mobility
MobiCom '00 Proceedings of the 6th annual 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
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
| Hi-index | 0.00 |
In Computer-Communication Networks, addressing and routing have been fundamental issues that have challenged researchers -- resulting in myriads of addressing and routing protocols. In recent times, self-configuration of nodes has become a necessity due to large number of networked devices and pervasive use of networks. Emergence of autonomic networks based on wireless mesh or ad hoc approach underline the need for self-configuration. Besides, success in sensor technology resulting in proliferation of wireless sensor networks is rapidly pushing the frontiers of self-configuration in large scale. The solutions reported hitherto in literature, has an interesting Addressing, Routing and Mobility (A.R.M.) issues have been tackled separately. In this work, we propose Protocol for Evolutionary Addressing (PEA) Framework, pronounced as "P", which solves the problem of addressing and routing in unison - thereby eliminating the need for separate routing algorithm. In PEA Framework, nodes assume addresses and self-configure the forwarding tables to reflect the changes in the network topology. Besides, PEA Framework enables self-configuration of nodes in a network so that the network naturally evolves (or readjusts) as it grows (or changes). We describe the framework, protocol, and evolution of network in addition to analyzing the time and message complexity of the protocol.