Link-layer salvaging for making routing progress in mobile ad hoc networks

Yu, Chansu; Shin, Kang G.; Song, Lubo

doi:10.1145/1062689.1062721

Cited by 24 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is inline with [22], in which r c was used to indicate the distance of the "first-tier interferers". Our simulations (Section VI) relax this assumption.…”

Section: Interference Analysismentioning

confidence: 81%

Dynamic Spectrum Access Protocol Without Power Mask Constraints

Krunz

Younis²

2009

Ieee Infocom 2009

View full text Add to dashboard Cite

Abstract-In this work, we investigate a statistical approach for dynamic spectrum access and radio resource management (RRM) in opportunistic cognitive radio (CR) networks. We propose a distributed MAC protocol for such networks that enables unlicensed users to dynamically utilize the available spectrum while limiting the imposed interference on primary (PR) users. Our proposed protocol is novel in three aspects. First, it does not require CR users to coordinate with PR users. Second, it does not assume any predefined CR-to-PR power mask, and thus can exploit the available spectrum more efficiently. Third, it provides the PR users with a statistical guarantee on the fraction of time that their reception may be corrupted by CR users. To avoid corrupting PR user receptions, the protocol computes the maximum power that a CR transmission can use based on current network conditions. We show how to compute this maximum power by deriving models for the PR-to-CR and PR-to-PR interference. Simulation experiments illustrate that our MAC protocol can satisfy the statistical guarantee for PR users under various user deployment models and traffic loads.

show abstract

“…This is inline with [22], in which r c was used to indicate the distance of the "first-tier interferers". Our simulations (Section VI) relax this assumption.…”

Section: Interference Analysismentioning

confidence: 81%

Dynamic Spectrum Access Protocol Without Power Mask Constraints

Krunz

Younis²

2009

Ieee Infocom 2009

View full text Add to dashboard Cite

show abstract

“…where d u,w and d v,w denote the sender-to-receiver (u-w) and interferer-to-receiver (v-w) distance, respectively (Yu et al, 2005). The PHY capacity can be interpreted as the number of successful concurrent transmissions using a fixed capture ratio (10 dB or 6 dB).…”

Section: Phy (Nearest One-hop) Capacitymentioning

confidence: 99%

A realistic mobility model for wireless networks of scale-free node connectivity

Lim

Das

2010

IJMC

Self Cite

View full text Add to dashboard Cite

Recent studies discovered that many of social, natural and biological networks are characterised by scale-free power-law connectivity distribution. We envision that wireless networks are directly deployed over such real-world networks to facilitate communication among participating entities. This paper proposes Clustered Mobility Model (CMM), in which nodes do not move randomly but are attracted more to more populated areas. Unlike most of prior mobility models, CMM is shown to exhibit scale-free connectivity distribution. Extensive simulation study has been conducted to highlight the difference between Random WayPoint (RWP) and CMM by measuring network capacities at the physical, link and network layers.Keywords: connectivity distribution; mobile communication; mobility model; network capacity; random waypoint mobility; scale-free wireless networks.Reference to this paper should be made as follows: Lim, S., Yu, C. and Das C.R. (2010)

show abstract

“…In this setting, each transmission does not interfere with the rest of the senders. [53] shows such an arrangement and only considers the first-tier (one hop away) interferes, since their interference is much stronger than that of second-tier (two hops away). The worst-case interference with respect to communication from i to j occurs when distances from j to the six interferes…”

Section: B Time To Construct Network Topologymentioning

confidence: 99%

ALARM: Anonymous Location-Aided Routing in Suspicious MANETs

Defrawy

Tsudik

2007

2007 IEEE International Conference on Network Protocols

View full text Add to dashboard Cite

Abstract-In most common mobile ad-hoc networking (MANET) scenarios, nodes establish communication based on long-lasting public identities. However, in some hostile and suspicious settings, node identities must not be exposed and node movements should be untraceable. Instead, nodes need to communicate on the basis of their current locations. While such MANET settings are not very common, they do occur in military and law enforcement domains and require high security and privacy guarantees. In this paper, we address a number of issues arising in suspicious location-based MANET settings by designing and analyzing a privacy-preserving and secure linkstate based routing protocol (ALARM). ALARM uses nodes' current locations to securely disseminate and construct topology snapshots and forward data. With the aid of advanced cryptographic techniques (e.g, group signatures), ALARM provides both security and privacy features, including: node authentication, data integrity, anonymity and untraceability (trackingresistance). It also offers protection against passive and active insider and outsider attacks. To the best of our knowledge, this work represents the first comprehensive study of security, privacy and performance trade-offs in the context of link-state MANET routing.

show abstract

Link-layer salvaging for making routing progress in mobile ad hoc networks

Cited by 24 publications

References 24 publications

Dynamic Spectrum Access Protocol Without Power Mask Constraints

Dynamic Spectrum Access Protocol Without Power Mask Constraints

A realistic mobility model for wireless networks of scale-free node connectivity

ALARM: Anonymous Location-Aided Routing in Suspicious MANETs

Contact Info

Product

Resources

About