Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
Article No.: 37, Pages 1 - 25
Abstract
We study the problem of spanner construction in wireless ad-hoc networks through power assignments under two spanner models—distance and energy. In particular, we are interested in asymmetric power assignments so that the induced communication graph holds good distance and energy stretch factors simultaneously. In addition, we consider the following optimization objectives: low total energy consumption, low interference level, low hopdiameter, and high network lifetime.
Two node deployment scenarios are studied: random and deterministic. For n random nodes distributed uniformly and independently in a unit square, we present several power assignments with varying construction-time complexities. The results are based on various geometric properties of random points and shortest path tree constructions. Due to the probabilistic nature of this scenario, the probability of our results converges to one as the number of network nodes, n, increases. For the deterministic case, we present two power assignments with nontrivial bounds. These are established in addition to shortcut edges that satisfy desired threshold stretch. To the best of our knowledge, these are the first results for spanner construction in wireless ad-hoc networks with provable bounds for both energy and distance metrics simultaneously. Our power assignments, in addition, try optimizing additional network properties, such as network lifetime, interference, and hop diameter.
References
[1]
Abu-Affash, A. K., Aschner, R., Carmi, P., and Katz, M. J. 2010. Minimum power energy spanners in wireless ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'10). 2411--2416.
[2]
Althöfer, I., Das, G., Dobkin, D., Joseph, D., and Soares, J. 1993. On sparse spanners of weighted graphs. Discrete Comput. Geometry 9, 1, 81--100.
[3]
Awerbuch, B. 1987. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC'87). 230--240.
[4]
Bao, L. and Garcia-Luna-Aceves, J. J. 2001. Channel access scheduling in ad hoc networks with unidirectional links. In Proceedings of the 5th International Workshop on Disuete Algorithms and Methods for Mobile Computing and Communications (DIALM'01). 9--18.
[5]
Berend, D., Segal, M., and Shpungin, H. 2010. Power efficient resilience and lifetime in wireless ad-hoc networks. Ad Hoc Sensors Wirel. Netw. 10, 1, 61--87.
[6]
Bertsekas, D. and Gallager, R. 1987. Data Networks. Prentice Hall, Upper Saddle River, NJ.
[7]
Burkhart, M., von Rickenbach, P., Wattenhofer, R., and Zollinger, A. 2004. Does topology control reduce interference? In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'04). 9--19.
[8]
Calinescu, G., Kapoor, S., Olshevsky, A., and Zelikovsky, A. 2003. Network lifetime and power assignment in ad hoc wireless networks. In Proceedings of the Annual European Symposium on Algoritms (ESA'03). 114--126.
[9]
Callahan, P. B. and Kosaraju, S. R. 1993. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algoritms (SODA'93). 291--300.
[10]
Carmi, P., Katz, M. J., Segal, M., and Shpungin, H. 2006. Fault-tolerant power assignment and backbone in wireless networks. In Proceedings of the 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06). 80--84.
[11]
Chandra, B., Das, G., Narasimhan, G., and Soares, J. 1992. New sparseness results on graph spanners. In Proceedings of the Annual Symposium on Computational Geometry (SCG'02). 192--201.
[12]
Chandra, B., Das, G., Narasimhan, G., and Soares, J. 1995. New sparseness results on graph spanners. Int. J. Computat. Geometry Appl. 5, 125--144.
[13]
Chandrakasan, A., Amirtharajah, R., Cho, S., Goodman, J., Konduri, G., Kulik, J., Rabiner, W., and Wang, A. 1999. Design considerations for distributed microsensor systems. In Proceedings of the Custom Integrated Circuits Conference (CICC'99). 279--286.
[14]
Chang, J.-H. and Tassiulas, L. 2000. Energy conserving routing in wireless ad-hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'00). 22--31.
[15]
Chen, W.-T. and Huang, N.-F. 1989. The strongly connecting problem on multihop packet radio networks. IEEE Trans. Commun. 37, 3, 293--295.
[16]
Chen, Z., Qiao, C., Xu, J., and Lee, T. 2007. A constant approximation algorithm for interference aware broadcast in wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'07). 740--748.
[17]
Cheong, O., Haverkort, H. J., and Lee, M. 2007. Computing a minimum-dilation spanning tree is np-hard. In Proceedings of the Computing. The Australisian Theory Symposium (CATS'08). 15--24.
[18]
Chew, L. P. 1986. There is a planar graph almost as good as the complete graph. In Proceedings of the Annual Symposium on Computational Geometry (SCG'86). 169--177.
[19]
Clementi, A. E. F., Huiban, G., Penna, P., Rossi, G., and Verhoeven, Y. 2002. Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE'02). 23--38.
[20]
Clementi, A. E. F., Penna, P., and Silvestri, R. 1999. Hardness results for the power range assignmet problem in packet radio networks. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinational Optimization Problems: Randomization, Approximation, and Combinational Algorithms and Techniques (RANDOM-APPROX'99). Lecture Notes in Computer Science, vol. 67, Springer, Berlin Heidelburg, 197--208.
[21]
Cohen, E. 1998. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 1, 210--236.
[22]
Dolev, S., Segal, M., and Shpungin, H. 2012. Bounded-hop energy-efficient liveness of flocking swarms. IEEE Trans. Mobile Comput. 99.
[23]
Elkin, M., Lando, Y., Nutov, Z., Segal, M., and Shpungin, H. 2011. Novel algorithms for the network lifetime problem in wireless settings. ACM Wirel. Netw. 17, 2, 397--410.
[24]
Eppstein, D. 2000. Spanning trees and spanners. In Handbook of Computational Geometry. Elsevier, Amsterdam, Chapter 9, 425--461.
[25]
Gao, J., Guibas, L. J., Hershberger, J., Zhang, L., and Zhu, A. 2001. Geometric spanner for routing in mobile networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'01). 45--55.
[26]
Gerla, M., Lee, Y.-Z., Park, J.-S., and Yi, Y. 2005. On demand multicast routing with unidirectional links. In Proceedings of the IEEE Wireless Comunications and Networking Conference (WCNC'05). 2162--2167.
[27]
Giordano, S., Stojmenovic, I., and Blazevic, L. 2001. Position based routing algorithms for ad hoc networks: A taxonomy. In Ad Hoc Wireless Networking. Springer, 103--136.
[28]
Gudmundsson, J. and Smid, M. H. M. 2006. On spanners of geometric graphs. In Proceedings of the Scandinarian Workshop on Algorithm Theory (SWAT'06). 388--399.
[29]
Hall, P. 1988. Introduction to the Theory of Coverage Processes. John Wiley and Sons, Hoboken, NJ.
[30]
Johansson, T. and Carr-Motyčková, L. 2005. Reducing interference in ad hoc networks through topology control. In Proceedings of the 6th ACM SIGACT/SIGMOBILE International Workshop on Foundation of Mobile Computing (DIALM-POMC'05). 17--23.
[31]
Keil, J. M. and Gutwin, C. A. 1992. Classes of graphs which approximate the complete euclidean graph. Discrete Computat. Geometry 7, 1, 13--28.
[32]
Kesselman, A., Kowalski, D., and Segal, M. 2005. Energy efficient communication in ad hoc networks from user's and designer's perspective. SIGMOBILE Mobile Comput. Commun. Rev. 9, 1, 15--26.
[33]
Khan, M., Kumar, V. S. A., Marathe, M. V., Pandurangan, G., and Ravi, S. S. 2009. Bi-criteria approximation algorithms for power-efficient and low-interference topology control in unreliable ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'09).
[34]
Kirousis, L. M., Kranakis, E., Krizanc, D., and Pelc, A. 2000. Power consumption in packet radio networks. Theor. Comput. Sci. 243, 1--2, 289--305.
[35]
Klein, R. and Kutz, M. 2006. Computing geometric minimum-dilation graphs is np-hard. In Proceeding of the 14th International Symposium on Graph Drawing. Lecture Notes in Computer Science, vol. 4372, Springer, Berlin Heidolbug, 196--207.
[36]
Lin, C.-H., Liu, B.-H., Yang, H.-Y., Kao, C.-Y., and Tsai, M.-J. 2008. Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks with unidirectional links. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'08). 351--355.
[37]
Lindsey, S., Sivalingam, K. M., and Raghavendra, C. S. 2002. Power optimization in routing protocols for wireless and mobile networks. In Handbook of Wireless Network and Mobile Computing, John Wiley & Sons, New York, NY. 407--423.
[38]
Lloyd, E. L. 1977. On triangulations of a set of points in the plane. In Proceedings of the IEEE Symposium on Foundation of Computer Science (FOCS'77). 228--240.
[39]
Lloyd, E. L., Liu, R., Marathe, M. V., Ramanathan, R., and Ravi, S. S. 2005. Algorithmic aspects of topology control problems for ad hoc networks. Mobile Netw. Appl. 10, 1--2, 19--34.
[40]
Macker, J. P. and Corson, M. S. 1998. Mobile ad hoc networking and the ietf. ACM Mobile Comput. Commun. Rev. 2, 1--14.
[41]
Moaveni-Nejad, K. and Li, X.-Y. 2005. Low-interference topology control for wireless ad hoc networks. Ad Hoc Sen. Wirel. Netw. 1, 1--2, 41--64.
[42]
Moscibroda, T., Wattenhofer, R., and Zollinger, A. 2006. Topology control meets sinr: The scheduling complexity of arbitrary topologies. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'06). 310--321.
[43]
Narasimhan, G. and Smid, M. H. M. 2007. Geometric Spanner Networks. Cambridge University Press, Cambridge, U.K.
[44]
Pahlavan, K. and Levesque, A. H. 1995. Wireless Information Networks. Wiley-Interscience, Hoboken, NJ.
[45]
Peleg, D. 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA.
[46]
Peleg, D. and Roditty, L. 2010. Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sen. Netw. 7, 3, 25:1--25:14.
[47]
Raab, M. and Steger, A. 1998. “Balls into bins” - a simple and tight analysis. In Proceedings of the International Workshop on Randmization and Approximation Techniques (RANDOM'08). 159--170.
[48]
Rajendran, V., Obraczka, K., and Garcia-Luna-Aceves, J. J. 2003. Energy-efficient collision-free medium access control for wireless sensor networks. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'03). 181--192.
[49]
Ramanathan, R. and Hain, R. 2000. Topology control of multihop wireless networks using transmit power adjustment. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'00). 404--413.
[50]
Ramasubramanian, V., Chandra, R., and Mossé, D. 2002. Providing a bidirectional abstraction for unidirectional adhoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02).
[51]
Römer, K. and Mattern, F. 2004. The design space of wireless sensor networks. IEEE Wirel. Commun. 11, 6, 54--61.
[52]
Salowe, J. S. 1991. Constructing multidimensional spanner graphs. Int. J. Computat. Geometry Appl. 1, 2, 99--107.
[53]
Schindelhauer, C., Volbert, K., and Ziegler, M. 2007. Geometric spanners with applications in wireless networks. Computat. Geometry: Theory Appl. 36, 3, 197--214.
[54]
Shpungin, H. 2011. Energy efficient online routing in wireless ad hoc networks. In Proceeding of the IEEE International Conference on Sensorard Ad Hoc Communications and Networks (SECON'11).
[55]
Shpungin, H. and Segal, M. 2009. Near optimal multicriteria spanner constructions in wireless ad-hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'09). 163--171.
[56]
Shpungin, H. and Segal, M. 2010. Near optimal multicriteria spanner constructions in wireless ad-hoc networks. IEEE/ACM Trans. Netw. 18, 6, 1963--1976.
[57]
Thorup, M. and Zwick, U. 2005. Approximate distance oracles. J. ACM 52, 1, 1--24.
[58]
Vaidya, P. M. 1991. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete Computat. Geometry 6, 4, 369--381.
[59]
van Hoesel, L. and Havinga, P. 2004. A lightweight medium access protocol (lmac) for wireless sensor networks:reducing preamble transmissions and transceiver state switches. In Proceedings of the International Conference on Networks Sensing Systems (INSS'04). 205--208.
[60]
Wang, Y. and Li, X.-Y. 2006. Minimum power assignment in wireless ad hoc networks with spanner property. J. Combinatorial Optimi. 11, 1, 99--112.
[61]
Zhang, H. and Hou, J. C. 2008. Asymptotic critical total power for k-connectivity of wireless networks. IEEE/ACM Trans. Netw. 16, 2, 347--358.
[62]
Zhang, Y., Gu, D., and Preneel, B. 2008. Reliable key establishment scheme exploiting unidirectional links in wireless sensor networks. In Proceedings of the IEEE/IPIP International Conference on Embedded and Ubiguitons Computing (EUC'08). 272--279.
Index Terms
- Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
Recommendations
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10: Proceedings of the 29th conference on Information communicationsThis paper studies the problem of topology control in random wireless ad-hoc networks through power assignment for n nodes uniformly distributed in a unit square. In particular, we are interested in asymmetric power assignments so that the induced ...
Minimum power energy spanners in wireless ad hoc networks
A power assignment is an assignment of transmission power to each of the nodes of a wireless network, so that the induced communication graph has some desired properties. The cost of a power assignment is the sum of the powers. The energy of a ...
Distance and Energy-Balance Based Reliable Broadcast in Mobile Ad Hoc Networks
WCSN '14: Proceedings of the 2014 International Conference on Wireless Communication and Sensor NetworkBroadcasting is the most common operation of data transmission in mobile Ad Hoc networks. The conventional blind flooding algorithm incurs the broadcast storm problem. Moreover, energy is critical for the life and the performance of Ad Hoc networks. In ...
Comments
Information & Contributors
Information
Published In
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Published: 23 July 2013
Accepted: 01 August 2012
Revised: 01 April 2012
Received: 01 April 2011
Published in TOSN Volume 9, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- U.S. Air Force European Office of Aerospace Research and Development
- Deutsche Telecom, European project FLAVIA
- Israeli Ministry of Industry, Trade and Labor (consortium CORNET)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 283Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in