ACM Home Page
Please provide us with feedback. Feedback
Routing in outer space: fair traffic load in multi-hop wireless networks
Full text PdfPdf (661 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing table of contents
Hong Kong, Hong Kong, China
SESSION: Routing and link scheduling I table of contents
Pages 23-32  
Year of Publication: 2008
ISBN:978-1-60558-073-9
Authors
Alessandro Mei  Sapienza University of Rome, Rome, Italy
Julinda Stefa  Sapienza University of Rome, Rome, Italy
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 338,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1374618.1374623
What is a DOI?

ABSTRACT

In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical - they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that does not create congested areas, does not have the associated security-related issues, and does not encourage selfish positioning. Moreover, the network lives longer of the same network using the original routing protocol (in spite of using more energy globally), and dies more gracefully.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. IEEE Communcations Magazine, 40:102--114, August 2002.
 
2
M. Bhardwaj and A. Chandrakasan. Bounding the lifetime of sensor networks via optimal role assignments. In Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), volume 3, pages 1587--1596, 2002.
3
4
5
 
7
Y. Ganjali and A. Keshavarzian. Load balancing in ad hoc networks: single-path routing vs. multi-path routing. In Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), volume 2, pages 1120--1125 vol.2, 2004.
 
8
P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions On Information Theory, 46(2), March 2000.
 
9
Z. Haas. A new routing protocol for the reconfigurable wireless networks. In Proc. of the IEEE Int. Conf. on Universal Personal Communications, October 1997.
 
10
 
11
X. Hong, P. Wang, J. Kong, Q. Zheng, and J. Liu. Effective probabilistic approach protecting sensor traffic. Military Communications Conference, 2005. MILCOM 2005. IEEE, 1:169--175, October 2005.
 
12
E. Hyytiä and J. Virtamo. On traffic load distribution and load balancing in dense wireless multihop networks. In NGI 2006, 2006.
 
13
P. Jacquet, P. Mühlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot. Optimized link state routing protocol for ad hoc networks. In Proceedings of the 5th IEEE Multi Topic Conference (INMIC 2001), 2001.
 
14
D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
15
16
 
17
S. Kwon and N. B. Shroff. Paradox of shortest path routing for large multi-hop wireless networks. In IEEE INFOCOM'07 Anchorage, May 2007.
18
 
19
 
20
21
 
22
P. P. Pham and S. Perreau. Increasing the network performance using multi-path routing mechanism with load balance. Ad Hoc Networks, 2:433--459, October 2004.
23
24
25
 
26
E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks, April 1999.
 
27
28
 
29
K. Seada and A. Helmy. Geographic protocols in sensor networks. Technical report, USC, July 2004.
 
30
V. Srinivasan, P. Neggehalli, C. F. Chiasserini, and R. R. Rao. Cooperation in wireless ad hoc wireless networks. In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), 2003.
31
32
 
33
A. Ward, A. Jones, and A. Hopper. A new location technique for the active office, 1997.
34
 
35
Y. Yu, R. Govindan, and D. Estrin. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical Report UCLA/CSD-TR-01-0023, UCLA Computer Science Department, May 2001.
36
 
37
A. Zemlianov and G. de Veciana. Capacity of ad hoc wireless networks with infrastructure support. IEEE Journal on selected areas in Communications, 23(3), March 2005.
38
 
39
M. Zorzi and R. R. Rao. Geographic random forwarding (geraf) for ad hoc and sensor networks: Energy and latency performance. IEEE Transactions on Mobile Computing, 2(4):349--365, 2003.
 
62

Collaborative Colleagues:
Alessandro Mei: colleagues
Julinda Stefa: colleagues