Information distribution and recharging dispatch strategy in large wireless networks
- UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
- Yanmao Man (Creator)
- Institution
- The University of North Carolina at Greensboro (UNCG )
- Web Site: http://library.uncg.edu/
- Advisor
- Jing Deng
Abstract: Large wireless networks are envisioned to play increasingly important roles as more and more mobile wireless devices and Internet of Things (IoT) devices are put in use. In these networks, it is often the case that some critical information needs to be readily accessible, requiring a careful design of the information distribution technique. In this work, we at first propose PeB, Periodic Broadcast, that takes advantage of periodic broadcast from the information server(s) to leave traces for nodes requesting for the information while maintaining a low overhead. Similar to swarm intelligence, PeB requires each node to keep track of traces, or past records of information flow, through itself toward information servers. We present our extensive investigation of the PeB scheme on cost and network dynamics as compared to other state-of-the-art techniques. When the devices run out of battery, they become static and need to be recharged by the wireless charging vehicles (WCVs). Often times, WCV receives a number of charging requests and form a Hamiltonian cycle and visit these nodes one-by-one. We also propose a heuristic algorithm, termed Quad, that generates a Hamiltonian cycle in a square plane. We then focus on the theoretical study of the length of the Hamiltonian cycles in such networks.
Information distribution and recharging dispatch strategy in large wireless networks
PDF (Portable Document Format)
605 KB
Created on 8/1/2017
Views: 275
Additional Information
- Publication
- Thesis
- Language: English
- Date: 2017
- Keywords
- Hamiltonian Cycle, Quadtree, Travel Salesman Problem, Wireless Rechargeable Networks
- Subjects
- Wireless sensor networks
- Ad hoc networks (Computer networks)
- Traveling salesman problem