Hierarchical, Multi-spanning Architecture for ManagedWireless Networks

The ubiquitous computing paradigm presents researchers with challenges in several fields of information technology. One of these challenges is global connectivity, i.e., connectivity regardless of place and time. A reasonable approach to this vision is the best effort extension of the Internet for the users of wireless communication devices. In this paper, we present one step toward this goal: a network architecture that provides the multi-hop extension of managed wireless networks, and a routing algorithm which relies on it. The architecture organizes nodes into multiple, dynamic address tree hierarchies based on physical connections. By these means, the architecture enables a multi-path routing mechanism that uses no routing tables, packets being deterministically forwarded based solely on the structure of their destination addresses.

[1]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[2]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[3]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[4]  Jian Liu,et al.  ATCP: TCP for mobile ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[5]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[6]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[7]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[9]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[10]  Xiaoyan Hong,et al.  A wireless hierarchical routing protocol with group mobility , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[11]  Michalis Faloutsos,et al.  Scalable ad hoc routing: the case for dynamic addressing , 2004, IEEE INFOCOM 2004.

[12]  P. F. Tsuchiya The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.

[13]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[14]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[15]  Michalis Faloutsos,et al.  PeerNet: Pushing Peer-to-Peer Down the Stack , 2003, IPTPS.

[16]  Xiaoyan Hong,et al.  Landmark routing for large ad hoc wireless networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).