131 research outputs found
A Penalty-Based Approach to Handling Cluster Sizing in Mobile Ad Hoc Networks
In Mobile Ad Hoc Networks (MANETs) nodes are allowed to move freely which causes instability in the network. To handle this, the nodes are grouped into clusters which make the topology of the network appear more stable. In proposed algorithms, the size of these clusters has been either ignored or handled insufficiently. This Thesis proposes a penalty-based approach to handle cluster sizing in a more appropriate manner. A configurable penalty function is defined which assigns penalties to each of the possible cluster sizes. The penalty is then used in conjunction with a merge qualifier to determine if a merge is allowed. Merges will be allowed if the total penalty of the two clusters decreases as a result of the merge. Additionally a split merge process has been developed to allow a number of nodes to split from a cluster and merge with a new cluster. A separate split merge qualifier is used to determine if a split merge will be allowed to happen; it will as long as the total penalty of the two clusters after the split merge is less than the total penalty before the split merge. Simulations and thorough analysis of the results show that the proposed changes are on par with the base algorithm used; however, the penalty function allows for a more complex clustering sizing strategy
A STABLE CLUSTERING SCHEME WITH NODE PREDICTION IN MANET
The main concern in MANET is increasing network lifetime and security. Clustering is one of the approaches that help in maintaining network stability. Electing an efficient and reliable Cluster Head (CH) is a challenging task. Many approaches are proposed for efficient clustering, weight-based clustering is one among them. This paper proposes a stable clustering scheme which provides network stability and energy efficiency. Proposed Stable Clustering Algorithm with Node Prediction (SCA-NP) computes the weight of the node using a combination of node metrics. Among these metrics, Direct Trust (DT) of the node provides a secure choice of CH and Node Prediction metric based on the minimum estimated time that node stay in the cluster provides the stable clustering. Mobility prediction is considered as the probability that a node stays in the network. This metric helps in electing CH which is available in the network for a longer time. Simulation is done in NS3 to evaluate the performance of SCA-NP in terms of clusters formed, network lifetime, efficiency in packet delivery, detecting malicious nodes and avoiding them in communication
Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach
Organization, scalability and routing have been identified as key problems
hindering viability and commercial success of mobile ad hoc networks.
Clustering of mobile nodes among separate domains has been proposed as an
efficient approach to address those issues. In this work, we introduce an
efficient distributed clustering algorithm that uses both location and energy
metrics for cluster formation. Our proposed solution mainly addresses cluster
stability, manageability and energy efficiency issues. Also, unlike existing
active clustering methods, our algorithm relieves the network from the
unnecessary burden of control messages broadcasting, especially for relatively
static network topologies. This is achieved through adapting broadcast period
according to mobile nodes mobility pattern. The efficiency, scalability and
competence of our algorithm against alternative approaches have been
demonstrated through simulation results.Comment: 7 pages, 9 figures; IEEE International Conference on Communications,
2006. ICC '0
A Review: Novel Protocol for Clumping in Mobile Ad hoc Networks
ABSTRACT: Mobile ad hoc networks (MANETs) is the combination of three words 1. Mobile(Movable or Transportable) 2. Adhoc( Temporary or for specific purpose) 3. Networks(Flexib le data applications which use networks to communicate) o r A MANET can be defined as a system of autonomous mobile nodes that communicate over wireless lin ks without bounded, defined or fixed infrastructure. MANETs are useful in places that have no communicat ions infrastructure. Mobile adhoc network is a type of ad hoc network that can change locations and configure itself on the fly. Base station plays a very important role in infrastructure based cellular networks . But to create a base station in infrastructure less network is very difficult b ecause of movable of nodes. Mapping the logic of base stations into mobile ad hoc networks leads to the design of logical clu mp, where the ch(clu mp head) in every clu mp play the role of base station. So clu mping is very important in this type of networks . The aim of this research work is to enhance the network lifetime , proper balancing the power consumption among mobile nodes and increase the throughput of the networks. For this type of architecture we have design some protocols and algorithms which a re : Closer Clu mp Detection Protocol (CCDP) , Energy Efficient Based Clu mping Algorith m (EEBCA ) and A Broadcasting Range Adjustment Protocol (BRAP) has been proposed which allo ws the isolated nodes to adjust their ranges to remain connected with existing c lu mp heads. Each of the work is evaluated separately to analyze their perfo rmances and compared with the co mpetent results. KEYWORDS: MANET, Clu mping, Clu mp head, CCDP, EEBCA, BRAP. I. INTRO DUCTION A Mobile Adhoc Network is a group of mobile nodes that can communicate to each other with out any fixed base station . The mobile nodes that are in clu mp range of each other can directly co mmunicate, whereas others needs the aid of intermediate nodes to route their packets. Each of the node has a wireless interface to commun icate with each other. These networks are fully distributed, and can work at any p lace without the help of any fixed infrastructure as access points or base stations
A survey on Routing Protocols in Wireless Sensor Networks
In ad-hoc WSN is a collection of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are changing on a continual basis. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to end communication. Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop nor neither direct reach ability is possible in case of WSNs. In order to facilitate communication within the network, a routing protocol is used. In this paper we have carried out an extensive survey on WSN protocols based on structure of network, routing protocol of network & clustering techniques of routing protocols
An efficient cluster-based service model for vehicular ad-hoc networks on motorways
Vehicular Ad-Hoc Networks (VANET) can, but not limited to provide users with useful traffic and environmental information services to improve travelling efficiency and road safety. The communications systems used in VANET include vehicle-to-vehicle communications (V2V) and vehicle-to-infrastructure communications (V2I). The transmission delay and the energy consumption cost for maintaining good-quality communications vary depending on the transmission distance and transmission power, especially on motorways where vehicles are moving at higher speeds. In addition, in modern transportation systems, electric vehicles are becoming more and more popular, which require a more efficient battery management, this also call for an efficient way of vehicular transmission. In this project, a cluster-based two-way data service model to provide real-time data services for vehicles on motorways is designed. The design promotes efficient cooperation between V2V and V2I, or namely V2X, with the objective of improving both service and energy performance for vehicular networks with traffic in the same direction. Clustering is an effective way of applying V2X in VANET systems, where the cluster head will take the main responsibility of exchanging data with Road Side Units (RSU) and other cluster members. The model includes local service data collection, data aggregation, and service data downloading. We use SUMO and OMNET++ to simulate the traffic scenarios and the network communications. Two different models (V2X and V2I) are compared to evaluate the performance of the proposed model under different flow speeds. From the results, we conclude that the cluster-based service model outperforms the non-clustered model in terms of service successful ratio, network throughput and energy consumption
Quality of service support for multimedia applications in mobile ad hoc networks
EThOS - Electronic Theses Online ServiceGBUnited Kingdo
A Review: Clumping in Mobile Adhoc Networks
ABSTRACT: Mobile ad hoc networks (MANETs) consist of mobile devices that form the wireless networks without any fixed infrastructure or centralized administration. The infrastructure based cellular architecture sets up base stations to support the node mobility. Mapping the concepts of base stations into MANET leads to the design of logical clump, where the clump heads in every clump play the role of base station. Clumping in MANET is the virtual partitioning of the dynamic nodes into various groups. In this paper, we have proposed protocols and algorithms for efficient design of clumping in MANET. Closer Clump Detection Protocol (CCDP) has been designed to help the nodes to probe their immediate neighbours. Energy Based Clumping Algorithm (EBCA) has been proposed that uses the node mobility and its available battery power for calculating the node weights. A Broadcasting Range Adjustment Protocol (BRAP) has been proposed which allows the isolated nodes to adjust their ranges to remain connected with existing clump heads. Each of the work is evaluated separately to analyse their performances and compared with the competent results
Using Road IDs to Enhance Clustering in Vehicular Ad hoc Networks
International audience—Vehicular ad hoc networks (VANETs) where vehicles act as mobile nodes is an instance of Mobile Ad hoc NETworks (MANETs), which are essentially developed for intelligent transportation systems. A challenging problem when designing communication protocols in VANETs is coping with high vehicle mobility, which causes frequent changes in the network topology and leads to frequent breaks in communication. The clustering technique is being developed to reduce the impact of mobility between neighboring vehicles. In this paper, we propose an Adaptive Weighted Cluster Protocol for VANETs, which is a road map dependent and uses road IDs and movement direction in order to make the clusters structure as stable as possible. The experimental results reveal that AWCP outperforms four other most commonly used clustering protocols in terms of control packet overhead, the packet delivery ratio, and the average cluster lifetime, which are the most usual metrics used for comparing performance
- …