Search results

Recent wireless communication and electronics technology has enabled the development of low‐cost, low‐power, and multi‐functional sensor nodes. However, the fact that sensor nodes are severely energy‐constrained has been an issue and many energy‐efficient routing protocols have been proposed to resolve it. Cluster‐based routing protocol is one of them. To achieve longer lifetime, some cluster‐based routing protocols use information on GPS‐based location of each sensor node. However, because of high cost, not all sensor nodes can be GPS‐enabled. The purpose of this paper is to propose a simple dynamic clustering approach to achieve energy efficiency for wireless sensor networks (WSN).

Instead of using location information of each sensor node, this approach utilizes information of remaining energy of each sensor node and changes in the number of cluster head nodes dependent on the number of sensor nodes alive. Performance results are presented and compared with some related protocols.

The simulations described in the paper show that both residual energy of each sensor node and changing cluster head nodes depending on the number of sensor nodes alive are very critical factors to obtain performance enhancement in terms of lifetime and data transmission. Especially, in some special environment, the proposal has better performance than GPS‐enabled protocol.

The paper is of value in proposing a simple dynamic clustering approach to achieve energy efficiency for WSN.

Data acquisition and data fusion of large numbers of sensors present unique challenges for control systems designers and applications engineers alike. In recent years the sensors industry has been moving towards the use of smart sensors, fieldbus networks, and localized smart processes. Merritt Systems Inc. of Rockledge, Florida, has been in the forefront of these developments since 1987 when it started pursuing the development of large sensor networks for robotic obstacle avoidance. As a result of this work a number of unique smart sensors and network technologies have been developed which have a wide range of applications beyond robotics. These include: one of industry’s first smart sensors, smart sensor networks, PC‐based data acquisition and control systems, and novel robotic modelling and motion planning algorithms. Whenever large networks of sensors with mixed sensing media are used, this technology has far‐reaching applications to industry and the research community.

Modern manufacturing plants have a desperate need for large amounts of sensor information, to refine and improve their production. A novel peer‐to‐peer distributed sensor network (DSN) framework is presented in this paper to continue the previous research of the IP sensor.

A device description sheet method, stemming from the TEDS of IEEE 1451 standard, is presented to achieve the self‐identify and self‐description of each IP sensor in a DSN application. Moreover, a virtual mapping mechanism, named transducer domain name server (TDNS), is also presented.

Ethernet is the backbone of the DSN architecture presented, and direct access between any two sensors located in a same DSN is allowable. With the help of the TDNS, the reallocation of each sensor's role at run‐time is achieved by performing a dynamic binding between the devices monitored and the IP sensors.

In the new proposal, two key problems, including the connection establishment of a large sensor network and the dynamic reallocation of each sensor's role at run‐time, are efficiently settled. All of the methods presented will be an important step towards seeking for a practical use at the production floor.

This paper aims to analyze the security issues that arise when integrating wireless sensor networks (WSN) and the internet. Also, it seeks to review whether existing technology mechanisms are suitable and can be applied in this context.

The paper considers the possible approaches that can be used to connect a WSN with the internet, and analyzes the security of their interactions.

By providing the services of the network through a front‐end proxy, a sensor network and the internet can interact securely. There are other challenges to be solved if the sensor nodes are integrated into the internet infrastructure, although there exists interesting advances on his matter.

The complete integration of sensor networks and the internet still remains as an open issue.

With the current state of the art, it is possible to develop a secure sensor network that can provide its services to internet hosts with certain security properties.

The paper studies the interactions between sensor networks and the internet from the point of view of security. It identifies both solutions and research challenges.

In the last decade, XML has become the de facto standard for data exchange in the world wide web (WWW). The positive benefits of data exchangeability to support system and software heterogeneity on application level and easy WWW integration make XML an ideal data format for many other application and network scenarios like wireless sensor networks (WSNs). Moreover, the usage of XML encourages using standardized techniques like SOAP to adapt the service‐oriented paradigm to sensor network engineering. Nevertheless, integrating XML usage in WSN data management is limited by the low hardware resources that require efficient XML data management strategies suitable to bridge the general resource gap. The purpose of this paper is to present two separate strategies on integrating XML data management in WSNs.

The paper presents two separate strategies on integrating XML data management in WSNs that have been implemented and are running on today's sensor node platforms. The paper shows how XML data can be processed and how XPath queries can be evaluated dynamically. In an extended evaluation, the performance of both strategies concerning the memory and energy efficiency are compared and both solutions are shown to have application domains fully applicable on today's sensor node products.

This work shows that dynamic XML data management and query evaluation is possible on sensor nodes with strict limitations in terms of memory, processing power and energy supply.

The paper presents an optimized stream‐based XML compression technique and shows how XML queries can be evaluated on compressed XML bit streams using generic pushdown automata. To the best of the authors' knowledge, this is the first complete approach on integrating dynamic XML data management into WSNs.

As large‐scale homogeneous networks suffer from high costs of communication, computation, and storage requirements, the heterogeneous sensor networks (HSN) are preferred because they provide better performance and security solutions for scalable applications in dynamic environments. Random key pre‐distribution schemes are vulnerable to collusion attacks. The purpose of this paper is to propose an efficient collusion resistant security mechanism for heterogeneous sensor networks.

The authors consider a heterogeneous sensor network (HSN) consists of a small number of powerful high‐end H‐sensors and a large number of ordinary low‐end L‐sensors. However, homogeneous sensor network (MSN) consists of only L‐sensors. Since the collusion attack on key pre‐distribution scheme mainly takes advantage of the globally applicable keys, which are selected from the same key pool, they update the key ring after initial deployment and generate new key rings by using one‐way hash function on nodes' IDs and initial key rings. Further, in the proposed scheme, every node is authenticated by the BS in order to join the network.

The analysis of the proposed scheme shows that even if a large number of nodes are compromised, an adversary can only exploit a small number of keys near the compromised nodes, while other keys in the network remain safe.

The proposed key management scheme described in the paper outperforms the previous random key pre‐distribution schemes by: considerably reducing the storage requirement, and providing more resiliency against node capture and collusion attacks.

Wireless sensor networks are expected to be an integral part of any pervasive computing environment. This implies an ever‐increasing need for efficient energy and resource management of both the sensor nodes, as well as the overall sensor network, in order to meet the expected quality of data and service requirements. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power consumption. However, there has been comparatively little prior art in the area of multi‐criteria based routing that exploit both the semantics of queries and the state of sensor nodes to improve network service longevity. In this paper, we look at routing in sensor networks from this perspective and propose an adaptive multi‐criteria routing protocol. Our algorithm offers automated reconfiguration of the routing tree as demanded by variations in the network state to meet application service requirements. Our experimental results show that our approach consistently outperforms, in terms of Network Lifetime and Coverage, the leading semantic‐based routing algorithm which reconfigures the routing tree at fixed periods.

Programming Sensor Networks currently is a subtle task not because of enormous amount of code but due to inherent limitations of embedded hardware like the power, memory, network bandwidth and clock speed. In addition, there are very few programming abstractions and standards available which lead to close coupling between the application code and the embedded OS requiring understanding of low‐level primitives during implementation. A Middleware can provide glue code between the applications and the heterogeneity of devices by providing optimized set of services for autonomously managing the resources and functionality of wireless nodes in a distributed wireless sensor network. This paper presents an autonomous middleware framework for low power distributed wireless sensor networks that support adaptive sensor functionality, context aware communications, clustering, quality of service and faulttolerance. Finally an application on how to use the autonomous middleware is illustrated on the Envelope System Research Apparatus (ESRA).

In particular, this paper aims to systematically analyze a few prominent wireless sensor network (WSN) clustering routing protocols and compare these different approaches according to the taxonomy and several significant metrics.

In this paper, the authors have summarized recent research results on data routing in sensor networks and classified the approaches into four main categories, namely, data-centric, hierarchical, location-based and quality of service (QoS)-aware, and the authors have discussed the effect of node placement strategies on the operation and performance of WSNs.

Performance-controlled planned networks, where placement and routing must be intertwined and everything from delays to throughput to energy requirements is well-defined and relevant, is an interesting subject of current and future research. Real-time, deadline guarantees and their relationship with routing, mac-layer, duty-cycles and other protocol stack issues are interesting issues that would benefit from further research.