research-article

Load balanced short path routing in large-scale wireless networks using area-preserving maps

Authors:

Mayank Goswami,

Xianfeng David Gu,

Vamsi PingaliAuthors Info & Claims

MobiHoc '14: Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing

Pages 63 - 72

https://doi.org/10.1145/2632951.2632987

Published: 11 August 2014 Publication History

Abstract

Load balanced routing in a network, i.e., minimizing the maximum traffic load any node carries for unsplittable flows, is a well known NP-hard problem. Finding practical algorithms remains a long standing challenge. In this paper we propose greedy routing using virtual coordinates that achieves both small path stretch ratio (compared to shortest path) and small load balancing ratio (compared to optimal load balanced routing), in a large scale wireless sensor network deployed densely inside a geometric domain with complex shape. We first provide a greedy routing scheme on a disk with a stretch ratio of at most 2, and under which the maximum load is a factor 4√2 smaller than the maximum load under shortest path routing. This is the first simple routing scheme with a small stretch that has been proven to outperform shortest path routing in terms of load balancing. Then we transform a network of arbitrary shape to a disk by an area preserving map φ. We show that both the path length and the maximum traffic load in the original network only increases by an additional factor of d², where d is the maximum length stretch of φ. Combined with the result on a disk we again achieve both bounded stretch and bounded load balancing ratio. Our simulation results evaluated the practical performance on both quality measures.

References

[1]

Schwarz-Christoffel toolbox for MATLAB. http://www.math.udel.edu/~driscoll/SC/.

[2]

M. Andrews and L. Zhang. Hardness of the undirected congestion minimization problem. SIAM Journal on Computing, 37(1):112--131, 2007.

Digital Library

[3]

C. Bishop. Conformal mapping in linear time. Discrete and Comput. Geometry, 44(2):330--428, 2010.

Digital Library

[4]

A. B. Brown and M. Halperin. On certain area-preserving maps. Annals of Mathematics, 36(4):833--837, Oct. 1935.

[5]

J. Bruck, J. Gao, and A. Jiang. MAP: Medial axis based geometric routing in sensor networks. Wireless Networks, 13(6):835--853, 2007.

Digital Library

[6]

C. Chekuri, S. Khanna, and F. B. Shepherd. An o(?n)-approximation for EDP in undirected graphs and directed acyclic graphs. Theory of Computing, 2:137--146, 2006.

[7]

J. Chuzhoy and S. Khanna. New hardness results for undirected edge-disjoint paths. Manuscript, 2005.

[8]

Q. Fang, J. Gao, and L. Guibas. Locating and bypassing routing holes in sensor networks. In Mobile Networks and Applications, volume 11, pages 187--200, 2006.

Digital Library

[9]

J. Gao and L. Zhang. Load balanced short path routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, Special Issue on Localized Communications, 17(4):377--388, April 2006.

Digital Library

[10]

J. Gao and L. Zhang. Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs. IEEE Transactions on Parallel and Distributed Computing, 20(2):171--179, February 2009.

Digital Library

[11]

E. A. Jonckheere, M. Lou, F. Bonahon, and Y. Baryshnikov. Euclidean versus hyperbolic congestion in idealized versus experimental networks. CoRR, abs/0911.2538, 2009.

[12]

B. Karp and H. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243--254, 2000.

Digital Library

[13]

R. M. Karp. Reducibility Among Combinatorial Problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.

[14]

J. Li and P. Mohapatra. Analytical modeling and mitigation techniques for the energy hole problem in sensor networks. Pervasive and Mobile Computing, 3(3):233--254, 2007.

Digital Library

[15]

MATLAB. version 7.10.0 (r2010a). The MathWorks Inc.,Natick, Massachusetts, 2010.

[16]

A. Mei and J. Stefa. Routing in outer space: fair traffic load in multi-hop wireless networks. In MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, pages 23--32, New York, NY, USA, 2008. ACM.

Digital Library

[17]

C. H. Papadimitriou and D. Ratajczak. On a conjecture related to geometric routing. Theor. Comput. Sci., 344(1):3--14, 2005.

Digital Library

[18]

L. Popa, A. Rostamizadeh, R. Karp, C. Papadimitriou, and I. Stoica. Balancing traffic load in wireless networks with curveball r outing. In MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pages 170--179, New York, NY, USA, 2007. ACM.

Digital Library

[19]

P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comp. and System Sciences, pages 130--143, 1988.

Digital Library

[20]

P. Raghavan and C. D. Thompson. Provably good routing in graphs: regular arrays. In Proceedings of the 17th annual ACM Symposium on Theory of Computing, pages 79--87, 1985.

Digital Library

[21]

R. Sarkar, W. Zeng, J. Gao, and X. D. Gu. Covering space for in-network sensor data storage. In Proc. of the 9th International Symposium on Information Processing in Sensor Networks (IPSN'10), pages 232--243, April 2010.

Digital Library

[22]

Y. Wang, J. Gao, and J. S. B. Mitchell. Boundary recognition in sensor networks by topological methods. In Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 122--133, September 2006.

Digital Library

[23]

X. Yu, X. Ban, R. Sarkar, W. Zeng, X. D. Gu, and J. Gao. Spherical representation and polyhedron routing for load balancing in wireless sensor networks. In Proc. of 30th Annual IEEE Conference on Computer Communications (INFOCOM'11), April 2011.

[24]

X. Zhu, R. Sarkar, J. Gao, and J. S. B. Mitchell. Light-weight contour tracking in wireless sensor networks. In Proceedings of the 27th Annual IEEE Conference on Computer Communications (INFOCOM'08), pages 960--967, May 2008.

Cited By

Chen QXia XLi ZZheng Y(2021)Collaborative Transmission over Intermediate Links in Duty-Cycle WSNs2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00111(843-850)Online publication date: Dec-2021
https://doi.org/10.1109/ICPADS53394.2021.00111
Diaz SMendez DKraemer R(2018)A Review on Self-Healing and Self-Organizing Techniques for Wireless Sensor NetworksJournal of Circuits, Systems and Computers10.1142/S0218126619300058(1930005)Online publication date: 19-Jun-2018
https://doi.org/10.1142/S0218126619300058
Singh JRai C(2018)An efficient load balancing method for ad hoc networksInternational Journal of Communication Systems10.1002/dac.350331:5Online publication date: 11-Jan-2018
https://doi.org/10.1002/dac.3503
Show More Cited By

Index Terms

Load balanced short path routing in large-scale wireless networks using area-preserving maps
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Load-Balanced Short-Path Routing in Wireless Networks

We study routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at ...
Cost reduction of reliable networks using load balanced routing

The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it ...
MidHopRoute: a multiple path routing framework for load balancing with service differentiation in wireless sensor networks

We introduce a simple but novel multiple path routing protocol to improve overall network lifetime by spread the routing load over a large number of sensor nodes and preventing congestion. We establish multiple paths between the source destination pairs ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '14: Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing

August 2014

460 pages

ISBN:9781450326209

DOI:10.1145/2632951

General Chairs:
Jie Wu
Temple University
,
Xiuzhen Cheng
George Washington University
,
Program Chairs:
XiangYang Li
Illinois Institute of Technology
,
Saswati Sarkar
University of Pennsylvania

Copyright © 2014 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]

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiHoc'14

Sponsor:

SIGMOBILE

MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

August 11 - 14, 2014

Pennsylvania, Philadelphia, USA

Acceptance Rates

MobiHoc '14 Paper Acceptance Rate 40 of 211 submissions, 19%;

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
297
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen QXia XLi ZZheng Y(2021)Collaborative Transmission over Intermediate Links in Duty-Cycle WSNs2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00111(843-850)Online publication date: Dec-2021
https://doi.org/10.1109/ICPADS53394.2021.00111
Diaz SMendez DKraemer R(2018)A Review on Self-Healing and Self-Organizing Techniques for Wireless Sensor NetworksJournal of Circuits, Systems and Computers10.1142/S0218126619300058(1930005)Online publication date: 19-Jun-2018
https://doi.org/10.1142/S0218126619300058
Singh JRai C(2018)An efficient load balancing method for ad hoc networksInternational Journal of Communication Systems10.1002/dac.350331:5Online publication date: 11-Jan-2018
https://doi.org/10.1002/dac.3503
Gao JDavid Gu XLuo F(2016)Discrete Ricci Flow for Geometric RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_602(556-563)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_602
Gao JGoswami M(2015)Medial Axis Based Routing Has Constant Load Balancing FactorAlgorithms - ESA 201510.1007/978-3-662-48350-3_47(557-569)Online publication date: 12-Nov-2015
https://doi.org/10.1007/978-3-662-48350-3_47
Gao JGu XLuo F(2015)Discrete Ricci Flow for Geometric RoutingEncyclopedia of Algorithms10.1007/978-3-642-27848-8_602-1(1-8)Online publication date: 5-May-2015
https://doi.org/10.1007/978-3-642-27848-8_602-1

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten