Name
Title | ||
|---|---|---|
On Expected Neighbor Discovery Time With Prior Information: Modeling, Bounds and Optimization. |
Abstract | ||
|---|---|---|
Neighbor discovery (ND) is an essential prerequisite for any peer-to-peer communication. In general, minimizing the discovery time is the goal for ND schemes. In this paper, we study the average discovery time for directional random ND when nodes have prior information about their set of possible neighbors, which also helps identify the performance limits of random ND schemes. Typically, discovery... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TWC.2017.2766219 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
Peer-to-peer computing,Dual band,Wireless communication,Uncertainty,Device-to-device communication,Ad hoc networks,Complexity theory | Data mining,Wireless,Upper and lower bounds,Algorithm,Real-time computing,Coupon collector's problem,Information model,Wireless ad hoc network,Neighbor Discovery Protocol,Convex optimization,Mathematics,Network structure | Journal |
Volume | Issue | ISSN |
17 | 1 | 1536-1276 |
Citations | PageRank | References |
4 | 0.42 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daoud Burghal | 1 | 14 | 5.31 |
| Arash Saber Tehrani | 2 | 99 | 6.41 |
| Andreas F. Molisach | 3 | 8233 | 616.51 |