Address assignment is a key challenge in ad hoc networks due to the lack of infrastructure. Autonomous addressing protocols require a distributed and self-managed mechanism to avoid address collisions in a dynamic network with fading channels, frequent partitions, and joining/leaving nodes. We propose and analyze a lightweight protocol that configures mobile ad hoc nodes based on a distributed address database stored in filters that reduces the control load and makes the proposal robust to packet losses and network partitions. We evaluate the performance of our protocol, considering joining nodes, partition merging events, and network initialization. Simulation results show that our protocol resolves all the address collisions and also reduces the control traffic when compared to previously proposed protocols.
Home
/
Computer Science Projects Abstract
/
AN EFFICIENT AND ROBUST ADDRESSING PROTOCOL FOR NODE AUTOCONFIGURATION IN AD HOC NETWORKS
AN EFFICIENT AND ROBUST ADDRESSING PROTOCOL FOR NODE AUTOCONFIGURATION IN AD HOC NETWORKS
About KSA Groups
Soratemplates is a blogger resources site is a provider of high quality blogger template with premium looking layout and robust design. The main mission of templatesyard is to provide the best quality blogger templates.
Computer Science Projects Abstract
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment