Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Neighbor Discovery in Wireless Networks with Multipacket Reception

Author:
Russell, Alexander  Vasudevan, Sudarshan  Wang, Bing  Zeng, Wei  Chen, Xian  Wei, Wei  


Journal:
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS


Issue Date:
2015


Abstract(summary):

Neighbor discovery is one of the first steps in configuring and managing a wireless network. Most existing studies on neighbor discovery assume a single-packet reception model where only a single packet can be received successfully at a receiver. In this paper, motivated by the increasing prevalence of multipacket reception (MPR) technologies such as CDMA and MIMO, we study neighbor discovery in MPR networks that allow packets from multiple simultaneous transmitters to be received successfully at a receiver. Starting with a clique of n nodes, we first analyze a simple Aloha-like algorithm and show that it takes Theta(n ln n/k) time to discover all neighbors with high probability when allowing up to k simultaneous transmissions. We then design two adaptive neighbor discovery algorithms that dynamically adjust the transmission probability for each node. We show that the adaptive algorithms yield a Theta(ln n) improvement over the Aloha-like scheme for a clique with n, nodes and are thus order-optimal. Finally, we analyze our algorithms in a general multi-hop network setting. We show an upper bound of O(Delta ln n/k) for the Aloha-like algorithm when the maximum node degree is Delta, which is at most a factor In n worse than the optimal. In addition, when Delta is large, we show that the adaptive algorithms are order-optimal, i.e., have a running time of O(Delta/k) which matches the lower bound for the problem.


Page:
1984---1998


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads