Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks

Bandyopadhyay, Subhajyoti; Coyle, Eugene; Falck, Thomas

doi:10.1109/ciss.2006.286649

Cited by 14 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1 depicts an example of possible transitions of p-BRW from a node to one of its neighbors. We also emphasize that the p-BRW is general enough and includes several random walks such as SRW, CRW on I-D ring [4], [6], non-backtracking random walk (NBRW) on regular graphs [2] as special cases. A detailed discussion on the special cases of p-BRW can be found in our technical report [ 10].…”

Section: A P-backtracking Random Walkmentioning

confidence: 99%

“…However, once the packet is forwarded to one of neighbors of node i, the behavior of packet transition over I-D ring and the average sojourn time will be different. In this regard, we first establish a mapping between the packet transition over I-D ring and the transition of a correlated random walk (CRW) [4], [6] on I-D ring. In the CRW on I-D ring, the walk at a vertex moves to its neighbor in the same direction (right or left) that the walk has taken, with probability (say p) larger than 0.5; otherwise, it changes the direction and moves to its another neighbor.…”

Section: Smart Sleep: How To Sleep More and Bettermentioning

confidence: 99%

See 1 more Smart Citation

Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

Lee

Eun

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties.However, a critical downside of SRW -slow diffusion or exploration over the space, typically leads to longer packet delay and undermines its own benefits. Such slow-mixing problem becomes even worse under random duty cycling adopted for energy conservation. In this paper, we study how to overcome this problem without any sacrifice or tradeoff, and propose a simple modification of random duty cycling, named Smart Sleep, which achieves more power-saving as well as faster packet diffusion (or smaller delay) while retaining the benefits of SRW. We also introduce a class of p.backtracking random walks and establish its properties to analytically explain the fast packet diffusion induced by Smart Sleep. We further obtain a necessary condition to achieve an optimal performance under our Smart Sleep, and finally demonstrate remarkable performance improvement via independent simulation results over various network topologies.

show abstract

Section: A P-backtracking Random Walkmentioning

confidence: 99%

Section: Smart Sleep: How To Sleep More and Bettermentioning

confidence: 99%

Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

Lee

Eun

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…It is known that with random mobility [41], the distribution and statistical measures of the Poisson Point Process are not altered. This is because each time interval is another realization of the Poisson Point Process.…”

Section: Effect Of Mobilitymentioning

confidence: 99%

“…This is because each time interval is another realization of the Poisson Point Process. Other mobility models, like those having temporal or spatial dependencies, or geographic restrictions, [42] may alter the node geometry of the network [41].…”

Section: Effect Of Mobilitymentioning

confidence: 99%

An intelligent hybrid spread spectrum MAC for interference management in mobile ad hoc networks

Ajmal¹,

Jabeen²,

Rasheed

et al. 2015

Computer Communications

View full text Add to dashboard Cite

“…In this latter context, the use of location information at the physical layer, in order to deliver increased performance via the use of spatial diversity, has garnered much interest in the recent research literature [1]- [5].…”

Section: Introductionmentioning

confidence: 99%

The optimal performance of cooperative communication systems as a function of location information quality

Chakrapani

Malaney

et al. 2010

2010 IEEE Globecom Workshops

View full text Add to dashboard Cite

In this work we investigate the use of location information in the context of emerging 4G wireless communication systems, in which cooperative communication among mobile nodes is utilized. We first determine the optimal throughput achievable in such systems under the assumption of perfect knowledge on the locations of the mobile nodes. We then investigate how the system throughput is significantly affected by the introduction of realistic errors on the reported locations of the nodes. The analytical framework, and the supporting simulations, we provide allow 4G cooperative communication systems to be properly designed for realistic working conditions. Our work also provides key insight into the critical trade-off between the lifetime and performance of wireless cooperative communication systems. Knowledge of this trade-off in the context of cross-layer design is discussed.

show abstract

Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks

Cited by 14 publications

References 16 publications

Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks

An intelligent hybrid spread spectrum MAC for interference management in mobile ad hoc networks

The optimal performance of cooperative communication systems as a function of location information quality

Contact Info

Product

Resources

About