http://www.eecs.ucf.edu/~dcm/Teaching/COT4810-Spring2011/Literature/SensorNetworksSurvey.pdf

Wireless sensor networks: a survey

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

/pdf/energy-efficient-communication-protocol-for-wireless-4vhuagusz2.pdf

Energy-efficient communication protocol for wireless microsensor networks

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

Energy-efficient communication protocols for wireless microsensor networks

Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

/pdf/an-application-specific-protocol-architecture-for-wireless-1s7y9fiv40.pdf

An application-specific protocol architecture for wireless microsensor networks

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

A dynamic load balancing policy with a central job dispatcher, called the LBC policy, is proposed for distributed systems. The design of this policy is motivated by the operation of a single-queue-multi-server queuing system. The average job response time of this policy is the same as that of a single-queue-multi-server system which is the best achievable performance when the communication delay is reduced to zero. Hence, this policy is expected to provide near minimum average job response time for distributed systems with high-speed communication subnets. The performance of this policy is studied for systems with non-negligible job transfer delays in the following three aspects: average job response time, overhead due to information exchanges, and sensitivity to heterogeneous load. >

A dynamic load balancing policy with a central job dispatcher (LBC)

Optimal Routing of Bit-Permutes on Hypercube Machines.

Optical Interconnection Networks.

Current routing services for sensor networks are often designed for specific applications and network conditions, thus have difficulty in adapting to application and network dynamics. This paper proposes an autonomic framework to promote the adaptivity of routing services in sensor networks. The key idea of this framework is to maintain some feature functions that are decoupled from originally-integrated routing services. This separation enables significant service changes to be done by only tuning these functions. Measures including parameterization are taken to save the energy for changing these functions. Further, this framework includes a monitoring module to support a policy-based collaborative adaptation. This paper shows an example autonomic routing service conforming to this framework.

https://link.springer.com/content/pdf/10.1007/s10586-006-7563-3.pdf

An autonomic routing framework for sensor networks

PROBLEM TO BE SOLVED: To obtain a multicast protocol for searching, participating in, and separating from an inexpensive and highly efficient multicast group by transmitting a message including a request for participating in the multicast distribution of identified information. SOLUTION: At the time of searching a node having requested multi-cast information, that is, a phenomenon 150 to be broadcast, a node 125 constitutes a path tree, and uses the tree for controlling the routing of a message in a discovery stage. Therefore, the node 120 transmits a discovery message to a node 135(G) and a node 120(D) according to the tree. Then, the node 125 steps to a participation stage by receiving a response message. In this stage, the node 125 constitutes the shortest path to the node 105, and transmits a request for participating in the multicast of the identified phenomenon and a participation message including the address of the node 125. COPYRIGHT: (C)1998,JPO

Cauligi S. Raghavendra

Papers

A dynamic load balancing policy with a central job dispatcher (LBC)

Optimal Routing of Bit-Permutes on Hypercube Machines.

Optical Interconnection Networks.

An autonomic routing framework for sensor networks

Method for participating in multicast connection started from source node for distributing multicast information