Much research has been devoted to freeform networks – that is, mobile, multi-hop wireless networks where the nodes move freely and unpredictably. This includes connected mobile ad hoc networks (MANETs) as well as disconnected networks such as vehicular ad hoc networks (VANETs) and opportunistic networks. To date, the fundamental goal of such research has primarily been data delivery between node pairs as identified by their IP addresses. Despite a rich literature of solutions to this problem extending back over 30 years, no sufficiently general, agreed-upon standard exists today.
This dissertation returns to the drawing board to rethink how to align modern data communications with the highly dynamic nature of freeform wireless networks and the broadcast nature of wireless channels. This leads to an entirely different approach, which is based on Named Data Networking (NDN). NDN asserts that data, not hosts, are the central element of modern networks.
The realization of this approach and core contribution of this dissertation is the Broadcast-Only Named Data (BOND) protocol, the first complete protocol specification based on NDN concepts. BOND has the following unique properties: (1) BOND supports all freeform networks, connected and disconnected, without so much as a configuration change. (2) BOND communication is entirely based on named data. (3) BOND's performance does not depend on the level of physical mobility in the network. (4) BOND uses exclusively broadcast communication for all packets, allowing for more efficient use of the wireless channel and more flexibility in the selection of MAC layer protocols.
Under simulation, BOND significantly outperforms existing protocols for both connected and disconnected networks. In all scenarios, whenever nodes are mobile, BOND consistently has the lowest roundtrip times and the highest response rate of any protocol tested, with overhead consistently ranking among the lowest observed.
[1]
Daniel Massey,et al.
Towards a New Internet Routing Architecture: Arguments for Separating Edges from Transit Core
,
2008,
HotNets.
[2]
Lixia Zhang,et al.
Ad hoc networking via named data
,
2010,
MobiArch '10.
[3]
Lan Wang,et al.
APT: A Practical Transit Mapping Service
,
2007
.
[4]
Sachin Katti,et al.
Trading structure for randomness in wireless opportunistic routing
,
2007,
SIGCOMM '07.
[5]
Amin Vahdat,et al.
Epidemic Routing for Partially-Connected Ad Hoc Networks
,
2009
.
[6]
Lixia Zhang,et al.
A taxonomy of biologically inspired research in computer networking
,
2010,
Comput. Networks.
[7]
Robert Tappan Morris,et al.
ExOR: opportunistic multi-hop routing for wireless networks
,
2005,
SIGCOMM '05.
[8]
Cauligi S. Raghavendra,et al.
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
,
2005,
WDTN '05.