Self-Organization of Activity in Wireless Sensor Networks (original) (raw)

Protocols for self-organization of a wireless sensor network

IEEE personal …, 2000

We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes. † This research is supported by DARPA contract number F04701-97-C-0010, and was presented in part at the 37 th Allerton Conference on Communication, Computing and Control, September 1999. ‡ Corresponding author. In this paper we describe an architecture for self-organizing wireless sensor-networks . These are wireless ad-hoc network that connect deeply embedded sensors, actuators, and processors. This combination of wireless and data networking will result in a new form of computational paradigm which is more communication centric than any other computer network seen before. Wireless sensor networks are part of a growing collection of information technology constructs which are moving away from the traditional desktop wired network architecture towards a more ubiquitous and universal mode of information connectivity .

Integrating Sensing Perspectives for Better Self Organization of Ad Hoc Wireless Sensor Networks

Journal of Information Science and …, 2004

Wireless sensor networks represent a new paradigm shift in ad hoc networks. In addition to ad hoc deployment and wireless communication capabilities, sensor nodes use on-board sensing and processing to sense (or detect) application specified events of interest. An ad hoc network of randomly deployed wireless sensor nodes is formed by having nodes pursue neighbor discovery and subsequent self organization. Since sensors typically run on batteries that have a limited lifetime, an energy-efficient self organized sensor network architecture becomes important. The design of a self organization protocol for sensor networks should, thus, incorporate not only the communication characteristics of the wireless medium but also several quality metrics associated with the sensing phenomenon.

Self-organization in ad hoc sensor networks: An empirical study

2002

Research in classifying and recognizing complex concepts has been directing its focus increasingly on distributed sensing using a large amount of sensors. The colossal amount of sensor data often obstructs traditional algorithms in centralized approaches, where all sensor data is directed to one central location to be processed. Spreading the processing of sensor data over the network seems to be a promising option, but distributed algorithms are harder to inspect and evaluate. Using self-sufficient sensor boards with short-range wireless communication capabilities, we are exploring approaches to achieve an emerging distributed perception of the sensed environment in realtime through clustering. Experiments in both simulation and real-world platforms indicate that this is a valid methodology, being especially promising for computation on many units with limited resources.

Location Information-Aided Task-Oriented Self-Organization of Ad-Hoc Sensor Systems

IEEE Sensors Journal, 2004

A novel task-oriented self-organization algorithm that accounts for mostly location-dependent tasks and heterogeneous sensors inherent in dense ad-hoc sensor systems is proposed. It forms a sensor group for an announced task by sequentially selecting the best matched sensors using a leader election algorithm and a residual task calculation algorithm. To improve the associated communication overhead, the sensor node location information is used in task broadcasting, thus confining the algorithm implementation to a dynamically maintained contributor group which comprises of those sensors which may contribute to the task. Sensor localization is based on a refinement of an algorithm in [1] which utilizes only the neighborhood information of each sensor node corresponding to its each preset radio transmission power level. The proposed self-organization algorithm and how various system parameters affect its performance are examined via extensive simulations. In a densely deployed sensor system, when the refined localization scheme is demonstrated to achieve very good localization, the proposed self-organization algorithm consistently yields a sensor group that covers the announced task.

Energy-Aware Self-Organization Algorithms for Wireless Sensor Networks

2008

Wireless sensor networks (WSN) have received much attention during the last few years especially with regard to energy consumption and scalability. In this paper, we will focus on mechanisms which may be implemented for small WSNs. So, in the present work, we design energy-aware selforganization algorithms for WSNs in such a context. These algorithms can be used to design effective and adaptive protocols. The first protocol concerns the initialization or the setting up of the network topology under a chain form. The second one (steady-state protocol) implements the communication part or the information exchange between the different nodes of the chain. Our algorithms were dimensioned and validated by an analytical model. We also perform a detailed study of these algorithms by using TOSSIM, a simulation environment for TinyOS, the operating system for the Berkeley sensor nodes. Finally, we achieve an experimental test using Tmote Sky nodes, a popular commercial hardware platform for wireless sensor systems. The results emphasize the interest of the proposed algorithms.

Self-organization in sensor networks

Journal of Parallel and Distributed Computing, 2004

In an effort to better guide research into self-configuring wireless sensor networks, we discuss a technical definition of the term self-organization. We define a selforganizing system as one where a collection of units coordinate with each other to form a system that adapts to achieve a goal more efficiently. We then lay out some conditions that must hold for a system to meet this definition and discuss some examples of self-organizing systems. Finally, we explore some of the ways this definition applies to wireless sensor networks.

Emergent self-organisation of wireless sensor networks

2007

This paper describes a protocol for dynamically configuring wireless sensor nodes into logical clusters. The concept is to be able to inject an overlay configuration into an ad-hoc network of sensor nodes or similar devices, and have the network configure itself organically. The devices are arbitrarily deployed and have initially have no information whatsoever concerning physical location, topology, density or neighbourhood. The Emergent Cluster Overlay (ECO) protocol is totally self-configuring and has several novel features, including nodes self-determining their mobility based on patterns of neighbour discovery, and that the target cluster size is specified externally (by the sensor network application) and is not directly coupled to radio communication range or node packing density. Cluster head nodes are automatically assigned as part of the cluster configuration process, at no additional cost. ECO is ideally suited to applications of wireless sensor networks in which localized groups of sensors act cooperatively to provide a service. This includes situations where service dilution is used (dynamically identifying redundant nodes to conserve their resources).

An investigation of self-organization in wireless sensor networks

2012

Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks technology. It is usually designed for special purpose applications. WSN has its own special characteristics that differentiate it from other types of wireless networks. These differences raise new challenges to be overcome; one of them is self-organization. As in any rising domain, it is essential to specifically define the meaning of new terminologies. The terms self-organizing and self-configuring are an example of such terms that may have overlapping meaning. In this investigation, we tried to make a definition for both terms to specifically determine their role in the WSN domain, and stress on the differences between them. Consequently, we tried to show the importance of self- organization in enhancing sensor network's performance, and efficient usage of its resources. Thus, we tried to highlight the role of different networking layers in affecting self-organization to be a guideline durin...

A brief survey of self-organization in wireless sensor networks

Wireless Communications and Mobile Computing, 2007

Many natural and man-made systems exhibit self-organization, where interactions among components lead to system-wide patterns of behavior. This paper first introduces current, scientific understanding of self-organizing systems and then identifies the main models investigated by computer scientists seeking to apply self-organization to design large, distributed systems. Subsequently, the paper surveys research that uses models of self-organization in wireless sensor networks to provide a variety of functions: sharing processing and communication capacity; forming and maintaining structures; conserving power; synchronizing time; configuring software components; adapting behavior associated with routing, with disseminating and querying for information, and with allocating tasks; and providing resilience by repairing faults and resisting attacks. The paper closes with a summary of open issues that must be addressed before self-organization can be applied routinely during design and deployment of senor networks and other distributed, computer systems.