Abstract
We present a deterministic solution for nodes in a mobile wireless ad hoc network to communicate reliably and maintain local neighborhood information. The nodes are located on a two-dimensional plane and may be in continuous motion. In our solution we tile the plane with hexagons. Each hexagon is assigned a color from a finite set of colors. Two hexagons of the same color are located sufficiently far apart so that nodes in these two hexagons cannot interfere with each other’s broadcasts. Based on this partitioning we develop a periodic deterministic schedule for mobile nodes to broadcast. This schedule guarantees collision avoidance. Broadcast slots are tied to geographic locations instead of nodes and the schedule for a node changes dynamically as it moves from tile to tile. The schedule allows nodes to maintain information about their local neighborhood. This information in turn is used to keep the schedule collision-free. We demonstrate the correctness of our algorithm, and discuss how the periodic schedule can be adapted for different scenarios.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arumugam, M., Kulkarni, S.S.: Self-Stabilizing Deterministic TDMA for Sensor Networks. In: International Conference on Distributed Computing and Internet Technologies, pp. 69–81 (2005)
Baldoni, R., Ioannidou, K., Milani, A.: Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 48–62. Springer, Heidelberg (2007)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time Complexity of Broadcast in Multi-Hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. Computer Systems and Sciences 45(1), 104–126 (1992)
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: MACAW: A Media Access Protocol for Wireless LANs. In: ACM SIGCOMM, Conference on Communications Architectures, Protocols, and Applications, pp. 212–225 (1994)
Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In: ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85–97 (1998)
Bruschi, D., Pinto, M.D.: Lower Bounds for the Broadcast Problem in Mobile Radio Networks. Distributed Computing 10(3), 129–135 (1997)
Ellen, F., Subramanian, S., Welch, J.L.: Maintaining Information About Nearby Processors in a Mobile Environment. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 193–202. Springer, Heidelberg (2006)
Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks. In: 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 222–232 (2003)
Greenberg, A.G., Winograd, S.: A Lower Bound on the Time Needed to Resolve Conflicts Deterministically in Multiple Access Channels. Journal of the ACM 32(3), 589–596 (1985)
IEEE 802.11, IEEE Standard for Information technology-Telecommunications and information exchange between systems-Local and metropolitan area networks-Specific requirements - Part 11: Wireless LAN MAC and PHY Specifications (2007)
Ioannidou, K.: Dynamic Quorum Systems in Mobile Ad-Hoc Networks. PhD. Thesis, Department of Computer Science, University of Toronto (2006)
Karn, P.: MACA - A New Channel Access Method for Packet Radio. In: ARRL/CRRL Amateur Radio 9th Computer Networking Conference, pp. 134–140 (1990)
Klappenecker, A., Lee, H., Welch, J.L.: Scheduling Sensors by Tiling Lattices. submitted for publication
Krishnamurthy, S., Thoppian, M.R., Kuppa, S., Chandrasekaran, R., Mittal, N., Venkatesan, S., Prakash, R.: Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. Computer Networks: The International Journal of Computer and Telecommunications Networking 52(4), 831–849 (2008)
Malpani, N., Chen, Y., Vaidya, N., Welch, J.L.: Distributed Token Circulation in Mobile Ad Hoc Networks. IEEE Transactions on Mobile Computing 4(2), 154–165 (2005)
Misener, J., Sengupta, R., Krishnan, H.: Cooperative Collision Warning: Enabling Crash Avoidance with Wireless Technology. In: 12th World Congress on ITS (2005)
Park, V., Corson, M.: A Highly Adaptive Distributed Routing Algorithm for Mobile Ad Hoc Networks. In: IEEE INFOCOM, The Conference on Computer Communications, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, pp. 1405–1413 (1997)
Perkins, C., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: 2nd Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999)
Petriu, E., Whalen, T., Abielmona, R., Stewart, A.: Robotic Sensor Agents: a New Generation of Intelligent Agents for Complex Environment Monitoring. IEEE Magazine on Instrumentation and Measurement 7(3), 46–51 (2004)
Prabh, K., Abdelzaher, T.: On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks. In: 19th Euromicro Conference on Real-Time Systems, pp. 136–145 (2007)
Prakash, R., Schiper, A., Mohsin, M., Cavin, D., Sasson, Y.: A Lower Bound for Broadcasting in Mobile Ad Hoc Networks. EPFL Technical report, IC/2004/37 (2004)
Wald, L.: When the Roads Talk, Your Car Can Listen. The New York Times, October 30 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viqar, S., Welch, J.L. (2009). Deterministic Collision Free Communication Despite Continuous Motion. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-05434-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05433-4
Online ISBN: 978-3-642-05434-1
eBook Packages: Computer ScienceComputer Science (R0)