Distributed Service Discovery for Heterogeneous Wireless Sensor Networks

Service discovery in heterogeneous Wireless Sensor Networks is a challenging research objective, due to the inherent limitations of sensor nodes and their extensive and dense deployment. The protocols proposed for ad hoc networks are too heavy for sensor environments. This paper presents a resourceaware solution for the service discovery problem, which exploits the heterogeneous nature of the sensor network and alleviates the high-density problem from the flood-based approaches. The idea is to organize nodes into clusters, based on the available resources and the dynamics of nodes. The clusterhead nodes act as a distributed directory of service registrations. Service discovery messages are exchanged among the nodes in the distributed directory. The simulation results show the performance of the service discovery protocol in heterogeneous dense environments

Scalable energy-efficient routing in mobile Ad hoc network

The quick deployment without any existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for dynamic situations such as military and rescue operations, disaster recovery, and so on and so forth. However, routing remains one of the major issues in MANET due to the highly dynamic and distributed environment. Energy consumption is also a significant issue in ad hoc networks since the nodes are battery powered. This report discusses some major dominating set based approaches to perform energy efficient routing in mobile ad hoc networks. It also presents the performance results for each of these mentioned approaches in terms of throughput, average end to end delay and the life time in terms of the first node failure. Based on the simulation results, I identified the key issues in these protocols regarding network life time. In this report, I propose and discuss a new approach “Dynamic Dominating Set Generation Algorithm” (DDSG) to optimize the network life time. This algorithm dynamically selects dominating nodes during the process of routing and thus creates a smaller dominating set. DDSG algorithm thereby eliminates the energy consumption from the non-used dominating nodes. In order to further increase the network life time, the algorithm takes into consideration the threshold settings which helps to distribute the process of routing within the network. This helps to eliminate a single dominating node from getting drained out by continuous transmission and reception of packets. In this report, the detailed algorithmic design and performance results through simulation is discussed

A Fair and Secure Cluster Formation Process for Ad Hoc Networks

An efficient approach for organizing large ad hoc networks is to divide the nodes into multiple clusters and designate, for each cluster, a clusterhead which is responsible for holding intercluster control information. The role of a clusterhead entails rights and duties. On the one hand, it has a dominant position in front of the others because it manages the connectivity and has access to other node¿s sensitive information. But on the other hand, the clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes from taking control of the group in a fraudulent way and avoid selfish attacks from suitable nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel solution that guarantees the clusterhead is elected in a cheat-proof manner

Self-stabilizing cluster routing in Manet using link-cluster architecture

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future