2010
DOI: 10.1504/ijmc.2010.032979
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…In some research, mobile anchor nodes move among unknown nodes with mobility model without considering WSN conditions [24]- [27]. Lim et al [24] use the simplest mobility model in which mobile anchor nodes move randomly.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In some research, mobile anchor nodes move among unknown nodes with mobility model without considering WSN conditions [24]- [27]. Lim et al [24] use the simplest mobility model in which mobile anchor nodes move randomly.…”
Section: Related Workmentioning
confidence: 99%
“…In some research, mobile anchor nodes move among unknown nodes with mobility model without considering WSN conditions [24]- [27]. Lim et al [24] use the simplest mobility model in which mobile anchor nodes move randomly. Many other mobile models such as Random Waypoint (RWP), Gauss-Markov (GM) and Group mobility model have also been used in mobile anchor node assisted localization schemes [25]- [27].…”
Section: Related Workmentioning
confidence: 99%
“…SC Instances These instances are generated on the basis of the well-known scale-free networks (see Barabasi and Albert (1999)). Scale-free networks frequently appear in the context of complex systems, including the World Wide Web, the internet backbone, infrastructure networks, airline connections, cellular networks, wireless networks, electric-power grids and many other contexts (see Strogatz (2001); Boccaletti et al (2006); Lim et al (2010)).…”
Section: Sc Their Topologies Resemble Different Geographic Local Strmentioning
confidence: 99%
“…It has been shown that a good load balancing algorithm produces considerable performance improvement which is done by transferring tasks from MA to AH or over-loaded working agents (WA) to under-loaded working agents (WA) efficiently. Dynamic load balancing reallocates the computing tasks based on the current workload [2,3]. It is more suitable to implement in the real computing cluster environment [4].…”
Section: Introductionmentioning
confidence: 99%