The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2013 vol.12)
pp: 516-528
S. Dolev , Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
M. Segal , Dept. of Commun. Syst. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
H. Shpungin , Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada
ABSTRACT
In this paper, we consider a set of n mobile wireless nodes, which have no information about each other. The only information a single node holds is its current location and future mobility plan. We develop a two-phase distributed self-stabilizing scheme for producing a bounded hop-diameter communication graph. In the first phase, nodes construct a temporary underlying topology and disseminate their current location and mobility plans. This is followed by a second phase, in which nodes construct the desired topology under two modes: static and dynamic. The static mode provides a fixed topology which does not change in spite of node movements; the dynamic mode allows the topology to change; however, the hop-diameter remains the same. We provide an O(λ,λ2)-bicriteria approximation (in terms of total energy consumption and network lifetime, respectively) algorithm in the static mode: for an input parameter λ, we construct a static h-bounded hop communication graph, where h=n/λ + log λ. In the dynamic mode, given a parameter h, we construct an optimal (in terms of network lifetime) h-bounded hop communication graph when every node moves with constant speed in a single direction along a straight line during each time interval. Our results are validated through extensive simulations.
INDEX TERMS
telecommunication network topology, energy consumption, graph theory, mobile communication, mobility management (mobile radio), static h-bounded hop communication graph, bounded-hop energy-efficient liveness, flocking swarms, mobile wireless nodes, two-phase distributed self-stabilizing scheme, bounded hop-diameter communication graph, static mode, dynamic mode, energy consumption, network lifetime, Topology, Network topology, Approximation algorithms, Mobile computing, Mobile communication, Ad hoc networks, Approximation methods, bounded diameter, Wireless ad hoc networks, mobility, topology control, energy efficiency
CITATION
S. Dolev, M. Segal, H. Shpungin, "Bounded-Hop Energy-Efficient Liveness of Flocking Swarms", IEEE Transactions on Mobile Computing, vol.12, no. 3, pp. 516-528, March 2013, doi:10.1109/TMC.2012.27
REFERENCES
[1] C. Ambühl, A. Clementi, M.D. Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi, and R. Silvestri, "Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks," Proc. Ann. Symp. Theoretical Aspects of Computer Science (STACS '04), pp. 418-427, 2004.
[2] B. Awerbuch, "Complexity of Network Synchronization," J. ACM, vol. 32, no. 4, pp. 804-823, 1985.
[3] L. Bao and J.J. Garcia-Luna-Aceves, "Channel Access Scheduling in Ad Hoc Networks with Unidirectional Links," Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '01), pp. 9-18, 2001.
[4] J. Basch, "Kinetic Data Structures," PhD Dissertation, Stanford Univ., 1999.
[5] J. Basch, L.J. Guibas, and J. Hershberger, "Data Structures for Mobile Data," Proc. Eighth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '97), pp. 747-756, 1997.
[6] R. Beier, P. Sanders, and N. Sivadasan, "Energy Optimal Routing in Radio Networks Using Geometric Data Structures," Proc. Int'l Colloquium on Automata, Languages and Programming (ICALP '02), pp. 366-376, 2002.
[7] M. Burkhart, P. von Rickenbach, R. Wattenhofer, and A. Zollinger, "Does Topology Control Reduce Interference?" Proc. ACM MobiHoc, pp. 9-19, 2004.
[8] G. Calinescu, S. Kapoor, and M. Sarwat, "Bounded-Hops Power Assignment in Ad Hoc Wireless Networks," Discrete Applied Math., vol. 154, no. 9, pp. 1358-1371, 2006.
[9] R. Chandra, C. Fetzer, and K. Högstedt, "Adaptive Topology Discovery in Hybrid Wireless Networks," Proc. Third Int'l Conf. Ad-Hoc Networks and Wireless (ADHOC-NOW '02), 2002.
[10] W.-T. Chen and N.-F. Huang, "The Strongly Connecting Problem on Multihop Packet Radio Networks," IEEE Trans. Comm., vol. 37, no. 3, pp. 293-295, Mar. 1989.
[11] M. Christersson, L. Gasieniec, and A. Lingas, "Gossiping with Bounded Size Messages in Ad Hoc Radio Networks," Proc. Int'l Colloquium on Automata, Languages and Programming (ICALP), pp. 377-389, 2002.
[12] A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri, "The Minimum Range Assignment Problem on Linear Radio Networks," Proc. Ann. European Symp. Algorithms (ESA '00), pp. 143-154, 2000.
[13] A.E.F. Clementi, P. Penna, and R. Silvestri, "Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks," Proc. Third Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques (RANDOM-APPROX '99), pp. 197-208, 1999.
[14] A.E.F. Clementi, P. Penna, and R. Silvestri, "On the Power Assignment Problem in Radio Networks," Technical Report TR00-054, Electronic Colloquium on Computational Complexity, vol. 7, 2000.
[15] A.E.F. Clementi, P. Penna, and R. Silvestri, "The Power Range Assignment Problem in Radio Networks on the Plane," Proc. Ann. Symp. Theoretical Aspects of Computer Science (STACS '00), pp. 651-660, 2000.
[16] R. Cohen and B. Kapchits, "Topology Maintenance in Asynchronous Sensor Networks," Proc. IEEE Comm. Soc. Conf. Sensor Mesh and Ad Hoc Comm. and Networks (SECON '08), pp. 542-550, 2008.
[17] B. Das and V. Bharghavan, "Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets," Proc. Int'l Conf. Comm. (ICC '97), pp. 376-380, 1997.
[18] B. Deb, S. Bhatnagar, and B. Nath, "A Topology Discovery Algorithm for Sensor Networks with Applications to Network Management," Proc. IEEE CAS Workshop Wireless Comm. and Networking, 2002.
[19] S. Dolev, Self-Stabilization. MIT, 2000.
[20] M. Elkin, Y. Lando, Z. Nutov, M. Segal, and H. Shpungin, "Novel Algorithms for the Network Lifetime Problem in Wireless Settings," Wireless Networks, vol. 17, no. 2, pp. 397-410, 2011.
[21] M. Elkin, Y. Lando, Z. Nutov, M. Segal, and H. Shpungin, "Novel Algorithms for the Network Lifetime Problem in Wireless Settings," ACM Wireless Networks, vol. 17, pp. 397-410, 2011.
[22] A. Ephremides, J.E. Wieseltheir, and D.J. Baker, "A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling," Proc. IEEE, vol. 75, no. 1, pp. 56-73, Jan. 1987.
[23] S. Funke and S. Soren Laue, "Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics via Coresets," Proc. Ann. Symp. Theoretical Aspects of Computer Science (STACS '07), vol. 4393, pp. 272-283, 2007.
[24] J. Gao, L.J. Guibas, and A. Nguyen, "Deformable Spanners and Applications," Computational Geometry: Theory and Applications, vol. 35, no. 1, pp. 2-19, 2006.
[25] L. Gasieniec, T. Radzik, and Q. Xin, "Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks," Proc. Scandinavian Workshop Algorithm Theory (SWAT), pp. 397-407, 2004.
[26] M. Gerla, Y.-Z. Lee, J.-S. Park, and Y. Yi, "On Demand Multicast Routing with Unidirectional Links," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '05), pp. 2162-2167, 2005.
[27] M. Gerla and J.T.-C. Tsai, "Multicluster, Mobile, Multimedia Radio Network," Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.
[28] S. Giordano, I. Stojmenovic, and L. Blazevic, "Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy," Ad Hoc Wireless Networking, pp. 103-136, Kluwer, 2001.
[29] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Proc. Fourth Ann. European Symp. Algorithms (ESA '96), pp. 179-193, 1996.
[30] H. Huang, A.W. Richa, and M. Segal, "Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks," Mobile Networks and Applications-Discrete Algorithms and Methods for Mobile Computing and Comm., vol. 9, no. 2, pp. 151-161, 2004.
[31] H. Huang, A.W. Richa, and M. Segal, "Dynamic Coverage in Ad-Hoc Sensor Networks," Mobile Networks and Applications, vol. 10, nos. 1/2, pp. 9-17, 2005.
[32] J. Park and S. Sahni, "Maximum Lifetime Broadcasting in Wireless Networks," IEEE Trans. Computers, vol. 54, no. 9, pp. 1081-1090, Sept. 2005.
[33] M. Khan, V.S.A. Kumar, M.V. Marathe, G. Pandurangan, and S.S. Ravi, "Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks," Proc. IEEE INFOCOM, 2009.
[34] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power Consumption in Packet Radio Networks," Theoretical Computer Science, vol. 243, nos. 1/2, pp. 289-305, 2000.
[35] K. Kothapalli, C. Scheideler, M. Onus, and A.W. Richa, "Constant Density Spanners for Wireless Ad-Hoc Networks," Proc. Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA '05), pp. 116-125, 2005.
[36] C.-H. Lin, B.-H. Liu, H.-Y. Yang, C.-Y. Kao, and M.-J. Tsai, "Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks with Unidirectional Links," Proc. IEEE INFOCOM, pp. 351-355, 2008.
[37] S. Lindsey, K.M. Sivalingam, and C.S. Raghavendra, "Power Optimization in Routing Protocols for Wireless and Mobile Networks," Handbook of Wireless Networks and Mobile Computing, pp. 407-423, John Wiley and Sons, 2002.
[38] K. Moaveni-Nejad and X.-Y. Li, "Low-Interference Topology Control for Wireless Ad Hoc Networks," Ad Hoc & Sensor Wireless Networks, vol. 1, nos. 1/2, pp. 41-64, 2005.
[39] K. Pahlavan and A.H. Levesque, Wireless Information Networks. Wiley-Interscience, 1995.
[40] V. Rajendran, K. Obraczka, and J.J. Garcia-Luna-Aceves, "Energy-Efficient Collision-Free Medium Access Control for Wireless Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 181-192, 2003.
[41] R. Ramanathan and R. Hain, "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment," Proc. IEEE INFOCOM, pp. 404-413, 2000.
[42] V. Ramasubramanian, R. Chandra, and D. Mossé, "Providing a Bidirectional Abstraction for Unidirectional Adhoc Networks," Proc. IEEE INFOCOM, 2002.
[43] R.R. Choudhury, S. Bandyopadhyay, and K. Paul, "A Distributed Mechanism for Topology Discovery in Ad Hoc Wireless Networks Using Mobile Agents," Proc. ACM MobiHoc, pp. 145-146, 2000.
[44] M. Segal, "Fast Algorithm for Multicast and Data Gathering in Wireless Networks," Information Processing Letters, vol. 107, no. 1, pp. 29-33, 2008.
[45] H. Shpungin and M. Segal, "Low Energy Fault Tolerant Bounded-Hop Broadcast in Wireless Networks," IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 582-590, Apr. 2009.
[46] L. van Hoesel and P. Havinga, "A Lightweight Medium Access Protocol (LMAC) for Wireless Sensor Networks: Reducing Preamble Transmissions and Transceiver State Switches," Proc. Int'l Workshop Networked Sensing Systems (INSS '04), pp. 205-208, 2004.
[47] Y. Zhang, D. Gu, and B. Preneel, "Reliable Key Establishment Scheme Exploiting Unidirectional Links in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Embedded and Ubiquitous Computing (EUC '08), pp. 272-279, 2008.
40 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool