An ACO Algorithm for Effective Cluster Head Selection

This paper presents an effective algorithm for selecting cluster heads in mobile ad hoc networks using ant colony optimization. A cluster in an ad hoc network consists of a cluster head and cluster members which are at one hop away from the cluster head. The cluster head allocates the resources to its cluster members. Clustering in MANET is done to reduce the communication overhead and thereby increase the network performance. A MANET can have many clusters in it. This paper presents an algorithm which is a combination of the four main clustering schemes- the ID based clustering, connectivity based, probability based and the weighted approach. An Ant colony optimization based approach is used to minimize the number of clusters in MANET. This can also be considered as a minimum dominating set problem in graph theory. The algorithm considers various parameters like the number of nodes, the transmission range etc. Experimental results show that the proposed algorithm is an effective methodology for finding out the minimum number of cluster heads.Comment: 7 pages, 5 figures, International Journal of Advances in Information Technology (JAIT); ISSN: 1798-2340; Academy Publishers, Finlan

Quality of service support for multimedia applications in mobile ad hoc networks

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Design and Implementation of an Architectural Framework for Web Portals in a Ubiquitous Pervasive Environment

Web Portals function as a single point of access to information on the World Wide Web (WWW). The web portal always contacts the portal’s gateway for the information flow that causes network traffic over the Internet. Moreover, it provides real time/dynamic access to the stored information, but not access to the real time information. This inherent functionality of web portals limits their role for resource constrained digital devices in the Ubiquitous era (U-era). This paper presents a framework for the web portal in the U-era. We have introduced the concept of Local Regions in the proposed framework, so that the local queries could be solved locally rather than having to route them over the Internet. Moreover, our framework enables one-to-one device communication for real time information flow. To provide an in-depth analysis, firstly, we provide an analytical model for query processing at the servers for our framework-oriented web portal. At the end, we have deployed a testbed, as one of the world’s largest IP based wireless sensor networks testbed, and real time measurements are observed that prove the efficacy and workability of the proposed framework

Stable Clustering through Mobility Prediction for Large-scale Multihop Intelligent Ad Hoc Networks

Abstract — In this paper we present a framework for dynamically organizing mobile nodes (MNs) in large-scale mobile ad hoc networks (MANETs), with the eventual aim to support Quality of Service (QoS). Our dynamic, distributed clustering approach is based on intelligent mobility prediction that enables each MN to anticipate the availability of its neighbors. We present a scalable way to predict the mobility, and thus availability, of MNs, achieved with the introduction of geographically-oriented virtual clusters. We name the proposed model as the (p, t, d)-clustering model that facilitates the formation of stable clusters. Simulation results demonstrate the performance advantages of our approach. Keywords- Ad-hoc networking; Mobility prediction; Hierarchical clustering, QoS

Scalable Location Services for Hierarchically Organized Mobile Ad hoc Networks

This paper proposes a location service to assist location-based routing protocols, realized through a novel Associativity-Based clustering protocol. The main goal of our scheme, which employs hierarchical principles, is to minimize the control traffic associated with location-management. In location-based routing protocols, the control traffic is mainly due to location-updates, queries and responses. Our scheme employs a novel geographically-oriented clustering scheme in order to minimize control traffic without impairing performance. In our location management scheme, nodes are assigned home-zones, and are required to send their location-updates to their respective homezones through a dominating-set. This strategy, unlike similar location-management approaches, minimizes inevitable superfluous flooding by every node, and prevents location updates and queries from traversing the entire network unnecessarily, hence conserving bandwidth and transmission power. The proposed scheme is evaluated through mathematical analysis and simulations, and the results indicate that our protocol scales well with increasing node-count, node-density and node-speed

Rate Allocation and Buffer Management for Proportional Service Differentiation in Location-Aided Mobile Ad Hoc Networks

Abstract. Given that applications and services for evolving mobile ad hoc networks (MANETs) have diverse quality of service requirements in a similar fashion to fixed networks, this paper proposes a proportional service differentiation (PSD) model. This model is highly scalable and simple to adopt in MANETs because it does not require explicit admission control or maintenance of state information in any intermediate node. It relies instead on localized scheduling and buffer management to achieve a desired global objective. Motivated by this aspect of the PSD model, we propose to combine it with a location-based forwarding strategy as a way to facilitate cross-layer optimization. This association is performed with a view to improve end-to-end service differentiation, although no other explicit mechanisms are used to achieve end-to-end guarantees. This model takes also into consideration the time-varying nature of available bandwidth in MANETs, and tries to calculate it dynamically. Simulation results confirm the per-hop performance improvement.

Quality of Service Support for Multimedia Applications in Mobile Ad Hoc Networks - A Cross-Layered Approach

Definition: Quality of Service (QoS) is characterized as a set of service requirements to be met by the network while transporting a packet stream between a given source-destination pair, while a Mobile Ad hoc NETwork (MANET) is defined as an “autonomous system of mobile routers (and associated hosts) connected by wireless links – the union of which form an arbitrary graph”

Stable Clustering Through Mobility Prediction for Large-scale Multihop Intelligent Ad Hoc Networks

In this paper we present a framework for dynamically organizing mobile nodes (MNs) in large-scale mobile ad hoc networks (MANETs), with the eventual aim to support Quality of Service (QoS). Our dynamic, distributed clustering approach is based on intelligent mobility prediction that enables each MN to anticipate the availability of its neighbors. We present a scalable way to predict the mobility, and thus availability, of MNs, achieved with the introduction of geographically-oriented virtual clusters. We name the proposed model as the (p, t, d)-clustering model that facilitates the formation of stable clusters. Simulation results demonstrate the performance advantages of our approach