Showing papers by "Tinku Rasheed published in 2007"

An Infrastructure-Free Traffic Information System for Vehicular Networks

Abstract: Vehicular networks are the major ingredients of the envisioned Intelligent Transportation Systems (ITS) concept. An important component of ITS which is currently attracting wider research focus is road traffic information processing. This has widespread applications in the context of vehicular networks. The existing centralized approaches for traffic estimation are characterized by longer response times. They are also subject to higher processing requirements and possess high deployment costs. In this paper, we propose a completely distributed and infrastructure-free mechanism for road density estimation. The proposed solution is adaptive and scalable and targets city traffic environments. The approach is based on the distributed exchange and maintenance of traffic information between vehicles traversing the routes. The performance analysis of the proposed mechanism shows the accuracy of the algorithm for different traffic densities. It also gives insights into the promptness of information delivery in the mechanism based on delay analysis at road intersections. This promptness is a necessary condition to various applications requiring reliable decision making based on road traffic awareness.

Cluster-Quality Based Hybrid Routing for Large Scale Mobile Multi-Hop Networks

Abstract: The rapid proliferation of wireless devices has lead to an augmentation in mobile ad hoc networking scenarios, particularly interesting for commercial applications and to network operators. Scalability of ad hoc networks, with respect to routing has been an important research issue recently. It is well known that clustering is the commonly agreed upon solution for efficient routing, topology management and resource utilization in a large scale mobile ad hoc network topology. This paper proposed a hybrid routing mechanism for cluster-based ad hoc networks, realized through a novel cluster-quality based routing approach. The main goal of our scheme, which employs a hybrid approach, is to guarantee efficient cluster-to-cluster routing by optimizing cluster-route selection. To achieve this, we introduce a new cluster-quality metric, which is an indirect quality-of-service metric that can estimate the current performance state of participating clusters. Since, traditional QoS metrics are hard to estimate in ad hoc networks and all the more challenging in a dynamic clustered network environment, the objective is to have a better adapted mechanism for providing guaranteed routing. The authors also present an optimization algorithm for intra-cluster routing and to reduce the cluster re-organization overhead. The proposed scheme is evaluated through simulations, and the results indicate that our protocol scales well with increasing node-count, node-density and node-speed. The effectiveness of the cluster-quality metric is also studied.

Scalable Multi-hop Ad Hoc Routing Using Modified OLSR Routing Protocol

Abstract: In this paper, we study the scalability of OLSR (Optimized Link State Routing) protocol, adapted for Multi-hop Mobile Ad Hoc Networks. We present a modified OLSR routing protocol, G-OLSR (Grid-OLSR) which incorporates the advantages of topology-based and position-based routing. The protocol has been designed to serve easier and robust ad hoc network deployments interesting for network operators and service providers, supporting mission-critical applications and innovative services as well as for fully distributed scenarios interesting for spontaneous deployments and mesh-type wireless multi-hop networks. The simulation results corroborates that the proposed schemes performs better than the OLSR routing scheme and from the analyses, we could interpret that G-OLSR is more suited for scalable mobile ad hoc networks.

An Efficient Stable Clustering Algorithm for Scalable Mobile Multi-Hop Networks

Abstract: The rapid proliferation of mobile devices has influenced the potential growth of wireless networking applications. This has lead to an augmentation in wireless ad hoc networking scenarios, particularly interesting for network operators. In this work, we present an adaptive framework for weight metric estimation and dissemination to construct stable and reliable weight-based clusters which can provide faster convergence rates and performance results for dynamic routing in mobile ad hoc networks. The framework considers critical node properties in determining a node's suitability for becoming clusterheads. It employs adaptive cluster radius and dynamic network constraints as the weight dissemination criterion. We observe that the proposed algorithm is suitable for scalable ad hoc networks and provides stable cluster formation decisions based on weighted metric approaches. Extensive performance evaluations confirm the suitability of the protocol for adaptive stable cluster formation and control overhead reduction in mobile ad hoc networks. We also provide comparisons with other clustering algorithms.

Personal Network Routing Protocol (PNRP) for Personal Ubiquitous Environments

Abstract: The proliferation of heterogeneous devices, ranging from mobile communication to home electronics and their internetworking have resulted into the development of a "personal ubiquitous environment" around the user. In this increasingly complex world, personal networks (PN) and personal network federations (PN-F) provide simple but powerful concepts towards the vision of "personal ubiquitous environments". This paper proposes solutions to realise the concepts of PN and PN-F. To this end, we first present the integrated convergence (ICON) layer which offers seamless interoperability across heterogeneous access technologies at mobile nodes in PNs. Then, we introduce the personal network routing protocol (PNRP) for personal ubiquitous environments. We also provide the implementation and the evaluation of PNRP. Our results show that PNRP efficiently manages the user's personal environments i.e. PNs and PN-Fs. Moreover, in terms of delay and packet delivery fraction, it performs almost similar to the traditional routing protocols such as OLSR and AODV. In contrast, PNRP consistently generates less routing load than any flat proactive MANET routing protocol.

A Profile-Based Network Layer Architecture for Personal Ubiquitous Environments

Abstract: The proliferation of heterogeneous devices, ranging from mobile communication to home electronics and their internetworking have resulted into the development of a "personal ubiquitous environment" around the user. In this increasingly complex world, personal networks (PN) and personal network federations (PN-F) provide simple but powerful concepts towards the vision of "personal ubiquitous environments". In this paper, we present the profile-based network layer design to realise the federations of personal networks. To this end, we introduce the possible architectures for PN federations and their initiation, formation and usage procedures, which are assisted by personal network profiles. Moreover, we also discuss the PN cluster formation procedure, which is performed by personal network routing protocol (PNRP). For the implementation and the evaluation of our proposed solutions, we particularly focus on spontaneous PN-F architecture. The proof-of-concept is given and the performance of our spontaneous PN-F scheme is evaluated.