Enabling limited traffic scheduling in asynchronous ad hoc networks

We present work-in-progress developing a communication framework that addresses the communication challenges of the decentralized multihop wireless environment. The main contribution is the combination of a fully distributed, asynchronous power save mechanism with adaptation of the timing patterns defined by the power save mechanism to improve the energy and bandwidth efficiency of communication in multihop wireless networks. The possibility of leveraging this strategy to provide more complex forms of traffic management is explored

Hierarchical Cluster-Based FIFO Asynchronous Data Transfer Technique for Reducing Congestion for Energy Efficient State Wireless Sensor Network-HAEEW

The applications of WSN can be quiet numerous. In applications like battlefield monitoring, grid power generation, health systems, sensors are deployed on large scale. During such deployment, energy efficiency must be proficient, which requires clustering, in the WSN architecture. Clustering architecture requires maintenance of sensor nodes due to alfunctioning of sensor which becomes depleted of energy. As some nodes leaves and some are being replaced, congestion is introduced in the network due the limited processing capability of memory, computations, and bandwidth condition. This paper proposes one of the energy efficient clustering techniques (HAEEW), using asynchronous data transfer (ADT), which has been modeled from data transfer technique (EEHCR), and using hierarchical clustering. Our model uses synchronization in clock time queries in one and each iterations round time, to determine cluster head, and head-set member formation, using Ad hoc on-demand energy aware routing protocols (AOERP) to make decision. In each iteration, the head-set members receives message request from neighboring nodes to confirm their average distance estimation, in which to transmit aggregated data to the base station. In a sensor deployment, which is aimed for data collection, control and management of sensor nodes, play a vital role, where nodes can be adjusted to boost energy in the network life time. We used matlab for simulations analysis of our result

Self-organization of Nodes using Bio-Inspired Techniques for Achieving Small World Properties

In an autonomous wireless sensor network, self-organization of the nodes is essential to achieve network wide characteristics. We believe that connectivity in wireless autonomous networks can be increased and overall average path length can be reduced by using beamforming and bio-inspired algorithms. Recent works on the use of beamforming in wireless networks mostly assume the knowledge of the network in aggregation to either heterogeneous or hybrid deployment. We propose that without the global knowledge or the introduction of any special feature, the average path length can be reduced with the help of inspirations from the nature and simple interactions between neighboring nodes. Our algorithm also reduces the number of disconnected components within the network. Our results show that reduction in the average path length and the number of disconnected components can be achieved using very simple local rules and without the full network knowledge.Comment: Accepted to Joint workshop on complex networks and pervasive group communication (CCNet/PerGroup), in conjunction with IEEE Globecom 201

Design and Implementation of a State-Driven Operating System for Highly Reconfigurable Sensor Networks

Due to the low-cost and low-power requirement in an individual sensor node, the available computing resources turn out to be very limited like small memory footprint and irreplaceable battery power. Sensed data fusion might be needed before being transmitted as a tradeoff between procession and transmission in consideration of saving power consumption. Even worse, the application program needs to be complicated enough to be self-organizing and dynamically reconfigurable because changes in an operating environment continue even after deployment. State-driven operating system platform offers numerous benefits in this challenging situation. It provides a powerful way to accommodate complex reactive systems like diverse wireless sensor network applications. The memory usage can be bounded within a state transition table. The complicated issues like concurrency control and asynchronous event handling capabilities can be easily achieved in a well-defined behavior of state transition diagram. In this paper, we present an efficient and effective design of the state-driven operating system for wireless sensor nodes. We describe that the new platform can operate in an extremely resource constrained situation while providing the desired concurrency, reactivity, and reconfigurability. We also compare the executing results after comparing some benchmark test results with those on TinyOS

An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes

Energy-Efficient {WSN} Infrastructure

International audienceEnergy conserving communication is one of the main challenges of wireless sensor networks. A number of studies and research are focused on saving energy and on extending the lifetime of these networks. Architectural approaches, like hierarchical structures, tend to organize network nodes in order to save energy. Most of these protocols need background information on the network in order to be efficient. In this paper, we describe a new approach for organizing large sensor networks into zones, based on the number of hops. This network architecture enables a hierarchical network view, with the purpose of offering efficient routing protocols based on zone partitioning. Simulations undertaken demonstrate that our approach is energy-efficient; this is highlighted by the reduction of traffic overhead

A taxonomic Approach to Topology Control in Ad-hoc and Wireless Networks

Topology Control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The protocols are designed for preserving connectivity, minimizing energy consumption, maximizing the overall network coverage or network capacity. Each TC protocol makes different assumptions about the network topology, environment detection resources, and control capacities. This circumstance makes it extremely difficult to comprehend the role and purpose of each protocol. To tackle this situation, a taxonomy for TC protocols is presented throughout this paper. Additionally, some TC protocols are classified based upon this taxonomy.Comment: The Sixth International Conference on Networking, ICN 200