research-article

The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

Authors:

Andy An-Kai Jeng,

Rong-Hong JanAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 18, Issue 4

Pages 536 - 549

https://doi.org/10.1109/TPDS.2007.1004

Published: 01 April 2007 Publication History

Abstract

In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r{\hbox{-}}{\rm neighborhood} graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 \le r \le 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r{\hbox{-}}{\rm neighborhood} graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YG_{k}, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(n\log n) time.

References

[1]

P. Bose, J. Gudmundsson, and P. Morin, “Ordered Theta Graphs,” Proc. Canadian Conf. Computational Geometry, 2002.

[2]

P. Bose, P. Morin, I. Stojmenović, and J. Urrutia, “Routing with Guarantee Delivery in Ad Hoc Networks,” ACM/Kluwer Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.

Digital Library

[3]

P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, “On the Spanning Ratio of Gabriel Graphs and Beta-Skeletons,” SIAM J. Discrete Math., 2004.

Digital Library

[4]

I. Chlamtac, M. Conti, and J.N. Liu, “Mobile Ad Hoc Networking: Imperatives and Challenges,” Ad Hoc Networks, vol. 1, pp. 13-64, 2003.

[5]

L. Feeney, “An Energy-Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks,” ACM J. Mobile Networks and Applications, vol. 3, no. 6, pp. 239-249, 2001.

Digital Library

[6]

K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, pp.259-278, 1969.

[7]

H.N. Gabow, J.L. Bently, and R.E. Tarjan, “Scaling and Related Techniques for Geometry Problems,” Proc. ACM Symp. Theory of Computing, pp. 135-143, 1984.

Digital Library

[8]

J. Geo, L.J. Guibas, J. Hershburger, L. Zhang, and A. Zhu, “Geometric Spanner for Routing in Mobile Networks,” Proc. ACM MobiHoc, 2001.

Digital Library

[9]

A.A.K. Jeng and R.H. Jan, “An Adjustable Structure for Topology Control in Wireless Ad Hoc Network,” Proc. 2005 Int'l Conf. Wireless Network Comm. and Mobile Computing, 2005.

[10]

J. Katajainen, “The Region Approach for Computing Relative Neighborhood Graphs in the Lp Metric,” Computing, vol. 40, pp.147-161, 1988.

Digital Library

[11]

B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. MobiCom, 2000.

Digital Library

[12]

P. Klein, S. Rao, M. Rauch, and S. Subramanian, “Faster Shortest-Path Algorithms for Planar Graph,” Proc. Symp. Theory of Computing, 1994.

Digital Library

[13]

L.A. Latiff and N. Fisal, “Routing Protocols in Wireless Mobile AdHoc Networks—A Review,” Comm., vol. 2, pp. 600-604, 2003.

[14]

W.H. Lee and T.H. Meng, “A Lower Power GPS Receiver Architecture,” Proc. Global Telecomm. Conf., vol. 11, pp. 153-157, 1999.

[15]

X.Y. Li, P.J. Wan, and Y. Wang, “Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 564-567, 2001.

[16]

X.Y. Li and P.J. Wan, “Constructing Minimum Energy Mobile Wireless Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 5, pp. 55-67, 2001.

Digital Library

[17]

X.Y. Li, P.J. Wan, Y. Wang, and O. Frieder, “Sparse Power Efficient Topology for Wireless Networks,” Proc. 35th Ann. Hawaii Int'l Conf. System Sciences (HICSS '02), vol. 9, 2002.

Digital Library

[18]

X.Y. Li, G. Calinescu, P.J. Wan, and Y. Wang, “Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp.1035-1047, Oct. 2003.

Digital Library

[19]

X.Y. Li and Y. Wang, “Efficient Construction of Low Weight Bounded Degree Planar Spanner,” Int'l J. Computational Geometry and Applications, vol. 14, nos. 1-2, pp. 69-84, 2004.

[20]

L. Li and J.Y. Halpern, “Minimum-Energy Mobile Wireless Networks Revisited,” Proc. IEEE Int'l Conf. Comm. (ICC '01), 2001.

Digital Library

[21]

R. Prakash, “Unidirectional Links Prove Costly in Wireless Ad-Hoc Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M), 1999.

Digital Library

[22]

F.P. Preparata and M.I. Shamos, Computational Geometry—An Introduction. Springer-Verlag, 1985.

Digital Library

[23]

R. Rajaraman, “Topology Control and Routing and Ad Hoc Network: A Survey,” ACM SIGACT, vol. 33, no. 2, 2002.

Digital Library

[24]

V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.

Digital Library

[25]

W.Z. Song, Y. Wang, and X.Y. Li, “Energy Efficiency: Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks,” Proc. Fifth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2004.

Digital Library

[26]

I. Stojmenovic and S. Datta, “Power and Cost Aware Localized Routing with Guaranteed Delivery in Wireless Networks,” Wireless Comm. and Mobile Computing, vol. 4, no. 2, pp. 175-188, 2004.

Digital Library

[27]

I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, 2001.

Digital Library

[28]

G.T. Toussaint, “The Relative Neighborhood Graph of a Finite Planar Set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.

[29]

Y. Wang and X.Y. Li, “Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks,” Int'l J. Foundations of Computer Science, vol. 14, pp. 183-200, 2003.

[30]

W. Wang, X.Y. Li, K. Moaveninejad, Y. Wang, and W.Z. Song, “The Spanning Ratios of Beta-Skeleton,” Proc. Canadian Conf. Computational Geometry (CCCG), 2003.

[31]

Y. Wang and X.Y. Li, “Localized Construction of Bounded Degree Planar Spanner for Wireless Ad Hoc Networks,” Proc. 2003 Joint Workshop Foundations of Mobile Computing, pp. 59-68, 2003.

Digital Library

[32]

R. Wattenhofer and A. Zollinger, “XTC: A Practical Topology Control for Ad-Hoc Networks,” Proc. 18th Parallel and Distributed Processing Symp., pp. 26-30, 2004.

[33]

A.C.C. Yao, “On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems,” SIAM J. Computing, vol. 11, pp. 721-736, 1982.

Cited By

Baskaran KMuthulakshmi K(2016)On the construction of localised topology structures in wireless networksInternational Journal of Information and Communication Technology10.1504/IJICT.2016.0799589:4(408-419)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1504/IJICT.2016.079958
Xin-Lin Huang Fei Hu Jun Wu Hsiao-Hwa Chen Gang Wang Tao Jiang (2015)Intelligent Cooperative Spectrum Sensing via Hierarchical Dirichlet Process in Cognitive Radio NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2014.236107533:5(771-787)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1109/JSAC.2014.2361075
Smys SRaj J(2015)A self-organized structure for mobility management in wireless networksComputers and Electrical Engineering10.1016/j.compeleceng.2015.09.02448:C(153-163)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.compeleceng.2015.09.024
Show More Cited By

Index Terms

The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

Recommendations

Energy-efficient topology control in wireless ad hoc networks with selfish nodes

In wireless ad hoc networks there is no fixed infrastructure or centralized controller to enforce cooperation between nodes. Therefore, nodes may act selfishly in running network protocols for conserving their own energy resources. In this paper, we ...
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes

We consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes, whose purpose is to maximize their own utility. In order to motivate nodes to follow the ...
Localized algorithms for energy efficient topology in wireless ad hoc networks
MobiHoc '04: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing

We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmission ranges. Our first structure has the following attractive properties: (...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 18, Issue 4

April 2007

144 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © 2007.

Publisher

IEEE Press

Publication History

Published: 01 April 2007

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Baskaran KMuthulakshmi K(2016)On the construction of localised topology structures in wireless networksInternational Journal of Information and Communication Technology10.1504/IJICT.2016.0799589:4(408-419)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1504/IJICT.2016.079958
Xin-Lin Huang Fei Hu Jun Wu Hsiao-Hwa Chen Gang Wang Tao Jiang (2015)Intelligent Cooperative Spectrum Sensing via Hierarchical Dirichlet Process in Cognitive Radio NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2014.236107533:5(771-787)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1109/JSAC.2014.2361075
Smys SRaj J(2015)A self-organized structure for mobility management in wireless networksComputers and Electrical Engineering10.1016/j.compeleceng.2015.09.02448:C(153-163)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.compeleceng.2015.09.024
Saleem YYau KMohamad HRamli NRehmani M(2015)SMARTComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.08.01991:C(196-224)Online publication date: 14-Nov-2015
https://dl.acm.org/doi/10.1016/j.comnet.2015.08.019
Gui JZeng Z(2015)Joint network lifetime and delay optimization for topology control in heterogeneous wireless multi-hop networksComputer Communications10.1016/j.comcom.2015.01.00559:C(24-36)Online publication date: 15-Mar-2015
https://dl.acm.org/doi/10.1016/j.comcom.2015.01.005
Yau KRamli NHashim WMohamad H(2014)Clustering algorithms for Cognitive Radio networksJournal of Network and Computer Applications10.1016/j.jnca.2014.07.02045:C(79-95)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1016/j.jnca.2014.07.020
Zhang ZZhang GZhang XFan J(2009)TAPProceedings of the 2009 IEEE international conference on Communications10.5555/1817271.1817357(458-463)Online publication date: 14-Jun-2009
https://dl.acm.org/doi/10.5555/1817271.1817357
Wang JLuo YHuang JZhang XNi LCao J(2008)VCGGProceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness10.5555/1535571.1535599(1-7)Online publication date: 28-Jul-2008
https://dl.acm.org/doi/10.5555/1535571.1535599
Mochaourab RDargie WDargie WKlauser B(2008)A fair and energy-efficient topology control protocol for wireless sensor networksProceedings of the 2nd ACM international conference on Context-awareness for self-managing systems10.1145/1367943.1367944(6-15)Online publication date: 19-May-2008
https://dl.acm.org/doi/10.1145/1367943.1367944
Andy An-Kai Jeng Rong-Hong Jan (2007)An Adaptive Topology Control Scheme for Energy-efficient Routing in Mobile Ad Hoc NetworksProceedings of the 2007 IEEE Wireless Communications and Networking Conference10.1109/WCNC.2007.802(4401-4404)Online publication date: 1-Mar-2007
https://dl.acm.org/doi/10.1109/WCNC.2007.802

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents