DocumentCode
3171415
Title
Buddy Routing: A Routing Paradigm for NanoNets Based on Physical Layer Network Coding
Author
Zhou, Ruiting ; Li, Zongpeng ; Wu, Chuan ; Williamson, Carey
Author_Institution
Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB, Canada
fYear
2012
fDate
July 30 2012-Aug. 2 2012
Firstpage
1
Lastpage
7
Abstract
NanoNets are networks of nanomachines at extremely small dimensions, on the order of nanometers or micrometers. Recent advances in physics and engineering have made basic computing and communication feasible on nanomachines, and NanoNets are envisioned as an important emerging technology with broad future applications. Traditional networking solutions require significant modifications for application in NanoNets. In this paper, we focus on routing algorithm design in NanoNets. Based on the salient features of a NanoNet, including low node cost and very low available power, we propose a new routing paradigm for multi-hop data transmission in NanoNets. Our design, termed {em Buddy Routing (BR)}, is enabled by latest advancements in physical layer network coding, and argues for pair-to-pair data forwarding in place of traditional node-to-node data forwarding. Through both analysis and simulations, we compare BR with point-to-point routing, in terms of raw throughput, error rate, energy efficiency, and protocol overhead, and show the advantages of BR in NanoNets.
Keywords
nanosensors; network coding; routing protocols; wireless sensor networks; BR paradigm; NanoNets; buddy routing paradigm; energy efficiency; error rate; low node cost; micrometer; multihop data transmission; nanomachine network; nanometer; node-to-node data forwarding; pair-to-pair data forwarding; physical layer network coding; point-to-point routing; protocol overhead; Algorithm design and analysis; Bit error rate; Routing; Signal to noise ratio; Unicast; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks (ICCCN), 2012 21st International Conference on
Conference_Location
Munich
Print_ISBN
978-1-4673-1543-2
Type
conf
DOI
10.1109/ICCCN.2012.6289272
Filename
6289272
Link To Document