Computer Science – Networking and Internet Architecture
Scientific paper
2010-12-05
Computer Science
Networking and Internet Architecture
12 pages, 4 figures
Scientific paper
This paper studies neighbor discovery problem in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed neighbor discovery is proposed, which enables all nodes to simultaneously discover their respective neighborhoods with a single frame of transmission. The key technique is to assign each node a unique on-off signature and let all nodes simultaneously transmit their signatures. Despite that the radios are half-duplex, each node observes a superposition of its neighbors' signatures through its own off-slots. To identify its neighbors out of a large network address space, each node solves a compressed sensing problem. Two practical schemes are studied. The first employs random on-off signatures, and each node discovers its neighbors using a noncoherent detection algorithm based on group testing. The second scheme uses on-off signatures based on a deterministic second-order Reed-Muller code, and applies a chirp decoding algorithm. The second scheme needs much lower signal-to-noise ratio (SNR) and a shorter frame to achieve the same error performance. A network of over one million Poisson distributed nodes is studied numerically, where each node has 30 neighbors on average, and the channel between each pair of nodes is subject to path loss and Rayleigh fading. Within a single frame of 4,096 symbols, nodes can discover their respective neighbors with on average 99.7% accuracy at 10 dB SNR. The complexity of the chirp decoding algorithm is sub-linear, so that it is in principle scalable to networks with 48-bit IEEE 802.11 MAC addresses. The compressed neighbor discovery schemes are much more efficient than conventional random access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered due to collisions.
Guo Dongning
Luo Jianfeng
Zhang Lianchang
No associations
LandOfFree
Compressed Neighbor Discovery for Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compressed Neighbor Discovery for Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Neighbor Discovery for Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-517596