A Study of Mobility in Ad Hoc Networks and Its Effects on a Hop Count Based Distance Estimation

Merkel, Sabrina; Mostaghim, Sanaz; Schmeck, Hartmut

doi:10.1109/ntms.2012.6208681

Cited by 6 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nodes are also capable of avoiding obstacle collision by deviating their path upon obstacle detection. The stream mobility (StrM) model [16] has a similar mobility pattern, simulating nodes in moving water or wind. Each node chooses a random angle and speed.…”

Section: Group Mobility Modelsmentioning

confidence: 99%

Modelling Mobility Based on Obstacle-Aware Human Behaviour in Disaster Areas

Conceição

Curado

2014

Wireless Pers Commun

View full text Add to dashboard Cite

Mobility models are used to mimic the realistic movement of entities. Mobility models for wireless networks feature different objectives and characteristics, most based on random behaviour. However, random based mobility models, such as the random waypoint, are often not suitable to represent the reality of node mobility, particularly in disaster areas where the search time for victims is a critical factor. This work studies the main existent mobility models able to suit disaster environments, according to specifically identified requirements. Moreover, a formal specification of the human behaviour for disaster areas (HBDA) mobility model is presented and an obstacle avoidance mechanism is introduced. Obstacle-aware HBDA is evaluated and compared with two existent mobility models, regarding its movement and network performances in different types of scenarios with variable network size and obstacle density. Obtained results show that obstacle-aware HBDA provides an even distribution of nodes, a efficient area coverage and a good transmission rate.

show abstract

Section: Group Mobility Modelsmentioning

confidence: 99%

Modelling Mobility Based on Obstacle-Aware Human Behaviour in Disaster Areas

Conceição

Curado

2014

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In this work, we are not proposing a completely new mobility model. Rather, we assume that the mobility of the nodes are given as semantics . For simulation, random way‐point model has been considered.…”

Section: Overview Of Policon Frameworkmentioning

confidence: 99%

PoliCon: a policy conciliation framework for heterogeneous mobile ad hoc networks

Maity

Ghosh

Al-Shaer

2014

Security Comm Networks

View full text Add to dashboard Cite

It is increasingly important to implement a conflict‐free access control policies for co‐allied networks where different organizations are involve for a common goal. Mobile ad hoc networks are widely used for mission critical situations where teams from different organizational networks cooperate to form a single network to implement their respective operations. These teams (or quads) have different sets of local policies enforced for their own security resulting heterogeneity in access control. Each team wants to preserve its access control policies at a maximum level. Moreover, a set of allied policies govern the cooperation and interaction between the different teams, which may conflict with their local policies. The policy conflicts arise from the transitivity of policy rules, mobility of the nodes, cooperative behaviors, and so on. In addition, the policy rules may be temporal or static. To achieve the successful completion of the mission, it may be required to compromise with the stringency of the enforcement of the conflicting rules for the quads. In this paper, we propose an automated and formal framework to find the optimal conciliation of the policy rules to preserve the mission and thus ensure minimal compromise with the enforcement of policy for each quad. The efficacy of the work lies on optimizing the enforcement of access control policies to achieve the coalition instead of negating the policy. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…Due to the fact that the neighbor closest to the referece device usually does not lie at the border of the communication range, but somewhere closer to the device itself, the distances are naturally overestimated throughout the network (cf. [5], [47]). Underestimation, due to the proposed distance estimation method, can only happen in a dynamic network.…”

Section: Distance Estimation With Firefly-inspired Hop Countingmentioning

confidence: 99%

“…As the distances are naturally overestimated, the mobility reduces the error for the distance estimates and, thus, the algorithms with higher proportion of underestimation have a lower MAPE. This effect is discussed in great detail for different kinds of mobility in [47]. The effect of mobility is higher, the further away a device moves from the reference device before updating its hop count.…”

Section: Distance Estimation With Firefly-inspired Hop Countingmentioning

confidence: 99%

Firefly-inspired synchronization for energy-efficient distance estimation in mobile ad-hoc networks

Merkel

Becker

Schmeck

2012

2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)

Self Cite

View full text Add to dashboard Cite

Mobile ad hoc networks (MANETs) are gaining increasing significance with computing devices becoming ubiquitous and equipped with wireless communication modules. Many applications for such networks require the devices to know their position within the network or their distance to other devices. Precise determination of these parameters often fails due to lack of information, missing hardware, or inaccessibility of needed resources, making an approximation necessary. We introduce an algorithm to calculate hop counts and, thereby, derive distances between devices. The algorithm is based on synchronization of all devices in the MANET. We show that an intentional phase shift of a periodically sent signal allows to estimate the distance between all devices in a network and a specific reference device. This approach significantly reduces the communication overhead leading to a more resource-efficient operation of the communication module and, thus, potentially extending the lifetime of the mobile devices. Experiments demonstrate that a network with an average of ten devices within communication range can be synchronized using a firefly-inspired decentralized synchronization algorithm. Also, we show that the resulting distance estimates have a higher accuracy compared to the results of an algorithm which is based on asynchronous exchange of messages.

show abstract

A Study of Mobility in Ad Hoc Networks and Its Effects on a Hop Count Based Distance Estimation

Cited by 6 publications

References 17 publications

Modelling Mobility Based on Obstacle-Aware Human Behaviour in Disaster Areas

Modelling Mobility Based on Obstacle-Aware Human Behaviour in Disaster Areas

PoliCon: a policy conciliation framework for heterogeneous mobile ad hoc networks

Firefly-inspired synchronization for energy-efficient distance estimation in mobile ad-hoc networks

Contact Info

Product

Resources

About