A fully distributed node allocation scheme with partition protection for Mobile Ad Hoc Networks

In this paper, a fully distributed node allocation scheme, namely Distributed Allocation Scheme (DisAS), is proposed for the purpose of partition protection in Mobile Ad Hoc Networks (MANETs). The proposed scheme controls the locations of nodes in a MANET in a dynamic way. A theoretical upper bound...

Full description

Saved in:
Bibliographic Details
Published in:Computer communications 2010-10, Vol.33 (16), p.1949-1960
Main Authors: Wang, Ting, Low, Chor Ping
Format: Article
Language:English
Subjects:
Allocations
Applied sciences
C (programming language)
Computer science
control theory
systems
Computer simulation
Computer systems and distributed systems. User interface
Distributed schemes
Dynamics
Exact sciences and technology
Mathematical models
Mobile Ad Hoc Network
Networks
Node allocation
Partition protections
Partitioning
Partitions
Software
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a fully distributed node allocation scheme, namely Distributed Allocation Scheme (DisAS), is proposed for the purpose of partition protection in Mobile Ad Hoc Networks (MANETs). The proposed scheme controls the locations of nodes in a MANET in a dynamic way. A theoretical upper bound on the probability of partitioning is derived in the scheme. An implementation of DisAS using normal distribution, which is referred to as Normally DisAS ( N -DisAS), is also discussed as a case study in this paper. Extensive simulations are carried out to show the effectiveness of N -DisAS in protecting MANETs from partitioning.
ISSN:0140-3664
1873-703X
DOI:10.1016/j.comcom.2010.06.021