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

Distributed sensor networks are a significant technology nowadays. Inexpensive, smart devices with multiple sensors provide opportunities for instrumenting, monitoring and controlling targeting systems. Such sensor nodes have capability for acquiring and embedded-processing of variety of data forms. Collaborative signal processing and fusion algorithms are needed to aggregate the distributed data from among the nodes in the network, including possibly multiple modalities of data within a sensor node, to make decisions in a reliable and efficient manner. One of the important sensor network applications is target classification in battlefields. This paper presents improved moving vehicle target classification performance using data obtained from sensor networks with collaboration both across nodes and within a node in terms of multimodal fusion. Results show that a 50% relative improvement in classification error can be obtained using collaboration both in the case of single vehicle target and those involving multi-vehicle convoys.

/pdf/collaborative-classification-applications-in-sensor-networks-11u0zi38cu.pdf

Collaborative classification applications in sensor networks

Monitoring and quantifying component behavior is key to, making networks reliable and robust. The agent-based architecture presented here continuously monitors network vulnerability metrics providing new ways to measure the impact of faults and attacks.

/pdf/impact-analysis-of-faults-and-attacks-in-large-scale-1pi0gqx2ur.pdf

Impact analysis of faults and attacks in large-scale networks

It is with great pleasure that we welcome you to attend the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002), held in Atlanta, on September 28, 2002. WSNA 2002, sponsored by ACM SIGMOBILE, is held in conjunction with ACM MobiCom 2002 conference. This workshop is a forum to discuss the latest findings in wireless sensors, communication protocols, and applications of wireless sensor networks.There has been tremendous technological advances in the development of low-cost sensor devices equipped with wireless network interfaces. The design of large-scale sensor networks interconnecting several hundred to a few thousand sensor nodes has attracted considerable research attention. Most of the funding agencies already have programs and new initiatives or are planning programs in sensor networks and their applications. Sensor networks find applications spanning several domains including military, medical, industrial, and home networks. Some of the key challenges deal with the scalability of network protocols to large number of nodes, design of simple and efficient protocols for different network operations, design of power-conserving protocols, design of data handling techniques including data querying, data mining, data fusion and data dissemination, and development of exciting new applications that exploit the potential of wireless sensor networks.The objective of this workshop is to provide a forum for researchers and technologists to present new and innovative research results in wireless sensor networks and their applications. We were very pleased with the interest and enthusiasm of several researchers to participate in the Technical Program Committee and help us put together this excellent program. We received over 60 submissions and each paper was reviewed by at least three program committee members, with some assistance from external reviewers. Due to time and space constraints, the workshop could accept only fifteen papers - regrettably, we could not accept several good quality papers. The technical program includes these 15 papers organized into four single-track sessions. We take this opportunity to thank the members of the Technical Program Committee and reviewers for their outstanding efforts.The success of this workshop depends on the contributions of many individuals. We would like to thank Prof. Ty Znati and Prof. Mehmet Ulema, ACM MobiCom Workshops Co-Chair, for their encouragement and support in the organizational matters, and Prof. Ian Aykildiz, ACM MobiCom General Chair. We are greatly indebted to Prof. Surendar Chandra, who did a superb job handling the web based paper submission system and the website and also for handling the local arrangements. We thank Prof. Surendar Chandra and Dr. Erdal Cayirci for their efforts in publicizing this workshop through various on-line mailing lists and other means. We thank the ACM staff and ACM SIGMOBILE office members for their timely help. Finally, on behalf of the Program Committee, we would like to extend our gratitude to the authors, session chairpersons, and the reviewers who contributed to this Workshop.

Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications

We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addressed in many previously proposed wormhole multicast algorithms. We also show that deadlocks on consumption channels can be avoided by using multiple classes of consumption channels and restricting the use of consumption channels by multicast messages. We provide upper bounds for the number of consumption channels required to avoid deadlocks. In addition, we present a new multicast routing algorithm, column-path, which is based on the well-known dimension-order routing used in many multicomputers and multiprocessors. Therefore, this algorithm could be implemented in existing multicomputers with simple changes to the hardware. Using simulations, we compare the performance of the proposed column-path algorithm with the previously proposed Hamiltonian-path-based multipath and an e-cube-based multicast routing algorithms. Our results show that for multicast traffic, the column-path routing offers higher throughputs, while the multipath algorithm offers lower message latencies. Another result of our study is that the commonly implemented simplistic scheme of sending one copy of a multicast message to each of its destinations exhibits good performance provided the number of destinations is small.

/pdf/resource-deadlocks-and-performance-of-wormhole-multicast-2oricpwl0x.pdf

Resource deadlocks and performance of wormhole multicast routing algorithms

A major challenge in metacomputing systems (computational grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repositories, to optimize desired global objectives. We develop a unified framework for resource scheduling in metacomputing systems where tasks with various requirements are submitted from participant sites. Our goal is to minimize the overall execution time of a collection of application tasks. In our model, each application task is represented by a directed acyclic graph (DAG). A task consists of several subtasks and the resource requirements are specified at subtask level. Our framework is general and it accommodates emerging notions of quality of service (QoS) and advance resource reservations. We present several scheduling algorithms which consider compute resources and data repositories that have advance reservations. As shown by our simulation results, it is advantageous to schedule the system resource separately. Our algorithms have at least 30% improvement over the separated approach with respect to completion time.

https://www.cct.lsu.edu/~kosar/csc7700-fall06/papers/Alhusaini99.pdf

Cauligi S. Raghavendra

Papers

Collaborative classification applications in sensor networks

Impact analysis of faults and attacks in large-scale networks

Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications

Resource deadlocks and performance of wormhole multicast routing algorithms

A unified resource scheduling framework for heterogeneous computing environments