Mobility Models, Traces and Impact of Mobility on Opportunistic Routing Algorithms: A Survey

Batabyal, Suvadip; Bhaumik, Parama

doi:10.1109/comst.2015.2419819

Cited by 145 publications

(72 citation statements)

References 103 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In addition, Long Tpause and small maxspeed leads to stable topology. In ROHC, the distance between two nodes (Compressor and Decompressor) using random way point model is thus calculated as follows [18]:…”

Section: Random Waypoint Mobility Modelmentioning

confidence: 99%

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Egbugha¹,

Umoh²,

Tekanyi³

2017

IJCA

View full text Add to dashboard Cite

This research presents the development of an Improved Intrusion Detection Secured RObust Header Compression (IDSROHC) technique for handling brute force attack. The Secured RObust Header Compression (Secured ROHC) was developed to secure internet protocol version six (IPv6) packets against false initial refresh attack by encrypting the cyclic redundancy check field. However, the CRC is only 3-8 bits long, which implies that a malicious node could still attempt a brute force approach, where it sends fake packets with all possible CRC combinations.An IDSROHC was developed using a modified selective watchdog intrusion detection algorithm. A MATLAB graphical user interface was design to aid presentation. IDSROHC was validated with Secured ROHC using throughput and packet delivery success. The results of this work show that IDSROHC produced 4.97% improvement in throughput and 29% improvement in packet delivery success over Secured ROHC.

show abstract

Section: Random Waypoint Mobility Modelmentioning

confidence: 99%

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Egbugha¹,

Umoh²,

Tekanyi³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…Mobility traces reflect the real nature of vehicular and human mobility. They are used to validate new applications and protocols [23]. They may also include the node contacts and information about nodes' interests [1].…”

Section: E Testing On Applicationsmentioning

confidence: 99%

“…Though mobility traces are very similar to real movement patterns, they introduce a high deployment cost and time overhead in contrast to mobility models [23]. As for mobility models they allow to test a very high number of nodes thus achieving scalability compared to mobility traces [23].…”

Section: E Testing On Applicationsmentioning

confidence: 99%

“…Many real mobility traces were captured to test ON [23], but the most used trace in ON literature is Infocom [24]. In the area of collaborative editing, Infocom was used to test the work of [1] in addition to Sigcomm [25] and UPB [26] mobility traces.…”

Section: E Testing On Applicationsmentioning

confidence: 99%

“…As for mobility models they allow to test a very high number of nodes thus achieving scalability compared to mobility traces [23].…”

Section: E Testing On Applicationsmentioning

confidence: 99%

See 2 more Smart Citations

Collaborative Editing over Opportunistic Networks: State of the Art and Challenges

Alsulami¹,

Cherif²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Emerging Opportunistic Networks (ON) are under intensive research and development by many academics. However, research efforts on ON only addressed routing protocols as well as data dissemination. Too little attention was given to the applications that can be deployed over ON. These are assumed to use immutable data (e.g., photos/video files). Nevertheless, Collaborative Editors (CE) which are based on mutable messages are widely used in many fields. Indeed, they allow many users to concurrently edit the same shared document (e.g., Google Docs). Consequently, it becomes necessary to adapt CE to ON which represents a challenging task. As a matter of fact, CE synchronization algorithms should ensure the convergence of the shared content being modified concurrently by users. In this work, we give an overview on ON and CE in an attempt to combine both states of the art. We highlight the challenges that could be faced when trying to deploy CE over ON.

show abstract

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

Mir

2022

Int J Communication

View full text Add to dashboard Cite

Summary Opportunistic ad hoc networks (OppNets) are characterized by intermittent and infrastructure‐less connectivity among mobile nodes with limited internode communication and buffer space. Without persistent end‐to‐end routing information, replication‐based routing techniques are often used to distribute duplicate messages in OppNets, which unfortunately leads to enormous costs of transmission, storage, and energy resources. Prior replication‐based routing schemes were mainly based on several premises, for example, the availability of global network knowledge, unlimited bandwidth capacity, and homogeneous contact patterns. In this paper, we propose a quota‐based routing scheme with finite buffer management, named QRBP, regardless of these weak premises. The QRBP scheme comprises two essential functions. First, only a portion of nodes with higher mobility are delegated to carry a certain quota of message replicas and disseminate those messages to nodes with lower mobility. The message traffic can be evenly diverted to relay nodes, which reduces the transmission overhead in the network. Second, nodes can manipulate message scheduling and dropping to improve the successful delivery rate according to heuristic strategies based on several measures of the quota value, remaining time‐to‐live, and contact rate with the destination. Furthermore, our study conducts extensive simulations under both synthetic and real mobility scenarios. In terms of transmission overhead ratio and successful delivery rate, the QRBP scheme performs better than Epidemic, Spray and Wait, and Temporal Closeness and Centrality‐Based (TCCB) routing schemes, as well as common buffer management policies like Drop Oldest, Drop Newest, Drop Random, and Space‐Time Drop.

show abstract

Mobility Models, Traces and Impact of Mobility on Opportunistic Routing Algorithms: A Survey

Cited by 145 publications

References 103 publications

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Collaborative Editing over Opportunistic Networks: State of the Art and Challenges

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

Contact Info

Product

Resources

About