Mobility and communication in wireless robot and sensor networks
Mobility is a primary goal of many wireless communication systems. In recent years, mobile multi-hop wireless networks, such as mobile wireless sensor networks and wireless robot networks, have attracted increased attention and have been extensively studied. However, most current research does not consider the interdependence of communication and mobility and much assume an obstacle-free environment in their problem modeling and solving process.In this dissertation, we discuss several research topics relevant to the above two issues of communication and mobility in wireless robot and sensor networks. First, we present multi-robot real-time exploration, which calls for the joint consideration of mobility and communication: it requires video and audio streams of a newly explored area be transmitted to the base station in a timely fashion as robots explore the area. Simulations show that our mobility model has achieved both improved communication quality and enhanced exploration efficiency.Second, we further investigate the above problem with two critical and real-world network conditions: (1) heterogeneous transmission ranges and link capacities, and (2) the impact of interference. The conditions increase the model complexity but significantly influence the actual available bandwidth and the required node size in placement. We jointly consider the relay placement and routing with these two critical conditions.Third, we introduce an online relay deployment paradigm to support remote sensing and control when mobile nodes migrate farther from the base station in a cost-effective system of mobile robots, static sensors and relays. A novel multi-robot real-time search method called STAtic Relay aided Search (STARS) is presented to allow robots to search in a known environment. Its solution is based on our near-optimal solution to a new variation of the multi-traveling salesman problem: precedence constrained two traveling salesman (PC2TSP).Fourth, we propose a heterogenous multi-robot exploration strategy with online relay deployment for an unknown environment called Bandwidth aware Exploration with a Steiner Traveler (BEST). In BEST, a relay-deployment node (RDN) tracks the FNs movement and places relays when necessary to support the video/audio streams aggregation to the base station. This problem inherits characteristics of both the Steiner minimum tree and traveling salesman problems. Extensive simulations show that BEST further enhances the exploration efficiency.While the first four topics deal with communication and mobility issues in powerful but expensive robotic systems, the fifth topic focuses on a special type of low cost, limited capability mobile sensors called hopping sensors, whose unique method of movement makes them suitable for rugged terrains. We present (1) a distributed message forwarding model called Binary Splitting Message Forwarding (BSMF) and (2) a grid based movement model unique to these hopping sensors. Simulation shows that our scheme significantly reduces the communication overhead and achieves relatively constant total energy consumption with varying amount of obstructions.Finally, we discuss the future work directions of this research work. We believe that a heterogeneous mobile platform to support real-time stream transmission by mobile robots, static sensor and communication devices, have great potential in various civilian and military applications, where the communication quality of service is critically important, as well as the mobility efficiency.
Read
- In Collections
-
Electronic Theses & Dissertations
- Copyright Status
- In Copyright
- Material Type
-
Theses
- Authors
-
Pei, Yuanteng
- Thesis Advisors
-
Mutka, Matt W.
- Committee Members
-
Esfahanian, Abdol-Hossein
Xi, Ning
Xiao, Li
- Date
- 2011
- Subjects
-
Mobile communication systems
Robots
Wireless communication systems
Wireless sensor networks
- Program of Study
-
Computer Science
- Degree Level
-
Doctoral
- Language
-
English
- Pages
- xii, 200 pages
- ISBN
-
9781267090461
1267090464
- Permalink
- https://doi.org/doi:10.25335/M5BX9W