Connectivity Maintenance and Task Allocation for Mobile Wireless Sensor Networks
To support communication among robots, we are proposing a connectivity maintenance system. We are defining a new graph property called k -redundancy and show that this property can be used to identify the importance of each node on the connectivity of the network. Once the importance of each node is determined, router robots can be placed around the more important nodes which improves the robustness of the network, and enables easier repair in case there are disconnections in the network. We show that the placement of router robots using this property can provide significant improvement on the connectivity of the network. We have studied this problem for mobile sensor networks, but this system is promising for all types of mobile ad-hoc networks.This transforms the network into a Voronoi diagram where nodes are located in Voronoi cells centered around robots. ... when the robot reaches the destination where it is supposed to repair connection, we assume that the node has failed.
| Title | : | Connectivity Maintenance and Task Allocation for Mobile Wireless Sensor Networks |
| Author | : | |
| Publisher | : | ProQuest - 2008 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
