Special Issue "Wireless Sensor Network and Its Application in Advanced Computer Science"
Quicklinks
A special issue of Sensors (ISSN 1424-8220). This special issue belongs to the section "Physical Sensors".
Deadline for manuscript submissions: closed (31 January 2010)
Special Issue Editors
Guest Editor
Prof. Dr. Jong Hyuk Park
Department of Computer Science and Engineering, Seoul National University of Technology, 172 Gongreung 2-dong, Nowon-gu, Seoul, 139-742, Korea
Website: http://jhpark.ftrg.org/
E-Mail: jhpark1@snut.ac.kr
Phone: +82 2 970 6702
Fax: +82 2 977 9441
Guest Editor
Dr. Sajid Hussain
Computer Science Department, Fisk University, Nashville, Tennessee, USA
Website: http://cs.acadiau.ca/~shussain/
E-Mail: shussain@fisk.edu
Phone: +1 902 585 1192
Fax: +1 902 585 1067
Special Issue Information
Dear Colleagues,
Wireless sensor networks (WSNs) are commonly used in pervasive and ubiquitous applications. WSNs are developed using both static (motes) and mobile (e.g. smart phone) sensor nodes for various applications such as smart homes, telehealth, surveillance, metering, and industry automation. In this special issue, we invite researchers and practitioners to submit their latest results and developments for the following topics:
- Applications using mobile phones and static sensors
- Algorithms and techniques for energy efficient communication
- Robustness and fault tolerance in WSNs
- Intelligent techniques and datamining for WSNs
- Query processing for data streams in WSNs
- Security and privacy issues in WSNs
- Telehealth services for elderly and chronic patients using WSNs
- Body area sensor networks
Prof. Dr. Jong Hyuk Park
Dr. Sajid Hussain
Guest Editors
Submission
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Sensors is an international peer-reviewed Open Access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1800 CHF (Swiss Francs).
Keywords
- wireless sensor networks
- mobile applications
- robustness
- fault tolerance
- energy efficient communication
- body area sensor networks
- intelligent techniques
- query processing
- health informatics
- telehealth
Published Papers (37 papers)
|
Received: 10 August 2009; in revised form: 9 September 2009 / Accepted: 10 September 2009 / Published: 11 September 2009
Show/Hide Abstract
| Download PDF Full-text (398 KB) | Download XML Full-text
Abstract: The power awareness issue is the primary concern within the domain of Wireless Sensor Networks (WSNs). Most power dissipation ocurrs during communication, thus routing protocols in WSNs mainly aim at power conservation. Moreover, a routing protocol should be scalable, so that its effectiveness does not degrade as the network size increases. In response to these issues, this work describes the development of an efficient routing protocol, named SHPER (Scaling Hierarchical Power Efficient Routing).
|
|
Received: 11 November 2009; in revised form: 12 December 2009 / Accepted: 20 December 2009 / Published: 30 December 2009
Show/Hide Abstract
| Download PDF Full-text (427 KB) | Download XML Full-text
Abstract: Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks.
|
|
Received: 27 October 2009; in revised form: 11 December 2009 / Accepted: 4 January 2010 / Published: 6 January 2010
Show/Hide Abstract
| Download PDF Full-text (888 KB) | Download XML Full-text
Abstract: In recent years, various received signal strength (RSS)-based localization estimation approaches for wireless sensor networks (WSNs) have been proposed. RSS-based localization is regarded as a low-cost solution for many location-aware applications in WSNs. In previous studies, the radiation patterns of all sensor nodes are assumed to be spherical, which is an oversimplification of the radio propagation model in practical applications. In this study, we present an RSS-based cooperative localization method that estimates unknown coordinates of sensor nodes in a network. Arrangement of two external low-cost omnidirectional dipole antennas is developed by using the distance-power gradient model. A modified robust regression is also proposed to determine the relative azimuth and distance between a sensor node and a fixed reference node. In addition, a cooperative localization scheme that incorporates estimations from multiple fixed reference nodes is presented to improve the accuracy of the localization. The proposed method is tested via computer-based analysis and field test. Experimental results demonstrate that the proposed low-cost method is a useful solution for localizing sensor nodes in unknown or changing environments.
 |
|
Received: 10 October 2009; in revised form: 25 January 2010 / Accepted: 30 January 2010 / Published: 3 February 2010
Show/Hide Abstract
| Download PDF Full-text (3510 KB) | Download XML Full-text
Abstract: This paper presents a secure decentralized clustering algorithm for wireless ad-hoc sensor networks. The algorithm operates without a centralized controller, operates asynchronously, and does not require that the location of the sensors be known a priori. Based on the cluster-based topology, secure hierarchical communication protocols and dynamic quarantine strategies are introduced to defend against spam attacks, since this type of attacks can exhaust the energy of sensor nodes and will shorten the lifetime of a sensor network drastically. By adjusting the threshold of infected percentage of the cluster coverage, our scheme can dynamically coordinate the proportion of the quarantine region and adaptively achieve the cluster control and the neighborhood control of attacks. Simulation results show that the proposed approach is feasible and cost effective for wireless sensor networks.
|
|
Received: 17 December 2009; in revised form: 4 February 2010 / Accepted: 9 February 2010 / Published: 26 February 2010
Show/Hide Abstract
| Download PDF Full-text (477 KB) | Download XML Full-text
Abstract: Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.
|
|
Received: 5 January 2010; in revised form: 28 January 2010 / Accepted: 5 February 2010 / Published: 26 February 2010
Show/Hide Abstract
| Download PDF Full-text (1091 KB) | Download XML Full-text
Abstract: In the paper, we propose a reliable asynchronous image transfer protocol, RAIT. RAIT applies a double sliding window method to node-to-node transfer, with one sliding window for the receiving queue, which is used to prevent packet loss caused by communication failure between nodes, and another sliding window for the sending queue, which prevents packet loss caused by network congestion. The routing node prevents packet loss between nodes by preemptive scheduling of multiple packets for a given image. RAIT implements a double sliding window method by means of a cross-layer design between the RAIT layer, routing layer, and queue layer. We demonstrate that RAIT guarantees a higher reliability of image transmission compared to the existing protocols.
|
|
Received: 10 January 2010; in revised form: 13 February 2010 / Accepted: 22 February 2010 / Published: 1 March 2010
Show/Hide Abstract
| Download PDF Full-text (675 KB) | Download XML Full-text
Abstract: An extremely reliable source to sink communication is required for most of the contemporary WSN applications especially pertaining to military, healthcare and disaster-recovery. However, due to their intrinsic energy, bandwidth and computational constraints, Wireless Sensor Networks (WSNs) encounter several challenges in reliable source to sink communication. In this paper, we present a novel reliable topology that uses reliable hotlines between sensor gateways to boost the reliability of end-to-end transmissions. This reliable and efficient routing alternative reduces the number of average hops from source to the sink. We prove, with the help of analytical evaluation, that communication using hotlines is considerably more reliable than traditional WSN routing. We use reliability theory to analyze the cost and benefit of adding gateway nodes to a backbone-assisted WSN. However, in hotline assisted routing some scenarios where source and the sink are just a couple of hops away might bring more latency, therefore, we present a Signature Based Routing (SBR) scheme. SBR enables the gateways to make intelligent routing decisions, based upon the derived signature, hence providing lesser end-to-end delay between source to the sink communication. Finally, we evaluate our proposed hotline based topology with the help of a simulation tool and show that the proposed topology provides manifold increase in end-to-end reliability.
 |
|
Received: 6 January 2010; in revised form: 21 January 2010 / Accepted: 7 February 2010 / Published: 11 March 2010
Show/Hide Abstract
| Download PDF Full-text (420 KB) | Download XML Full-text
Abstract: Due to the battery resource constraints, saving energy is a critical issue in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. Another possible solution is to employ an adaptive clustering hierarchy routing scheme. In this paper, we propose a multiple sink cluster wireless sensor networks scheme which combines the two solutions, and propose an efficient transmission power control scheme for a sink-centric cluster routing protocol in multiple sink wireless sensor networks, denoted as MSCWSNs-PC. It is a distributed, scalable, self-organizing, adaptive system, and the sensor nodes do not require knowledge of the global network and their location. All sinks effectively work out a representative view of a monitored region, after which power control is employed to optimize network topology. The simulations demonstrate the advantages of our new protocol.
|
|
Received: 3 February 2010; in revised form: 22 February 2010 / Accepted: 12 March 2010 / Published: 16 March 2010
Show/Hide Abstract
| Download PDF Full-text (868 KB) | Download XML Full-text
Abstract: Wireless Sensor Networks are presented as devices for signal sampling and reconstruction. Within this framework, the qualitative and quantitative influence of (i) signal granularity, (ii) spatial distribution of sensors, (iii) sensors clustering, and (iv) signal reconstruction procedure are assessed. This is done by defining an error metric and performing a Monte Carlo experiment. It is shown that all these factors have significant impact on the quality of the reconstructed signal. The extent of such impact is quantitatively assessed.
|
|
Received: 15 January 2010; in revised form: 20 February 2010 / Accepted: 15 March 2010 / Published: 18 March 2010
Show/Hide Abstract
| Download PDF Full-text (3008 KB) | Download XML Full-text
Abstract: Temperature in an urban area exhibits a complicated pattern due to complexity of infrastructure. Despite geographical proximity, structures of a group of buildings and streets affect changes in temperature. To investigate the pattern of fine-grained distribution of temperature, we installed a densely distributed sensor network called UScan. In this paper, we describe the system architecture of UScan as well as experience learned from installing 200 sensors in downtown Tokyo. The field experiment of UScan system operated for two months to collect long-term urban temperature data. To analyze the collected data in an efficient manner, we propose a lightweight clustering methodology to study the correlation between the pattern of temperature and various environmental factors including the amount of sunshine, the width of streets, and the existence of trees. The analysis reveals meaningful results and asserts the necessity of fine-grained deployment of sensors in an urban area.
|
|
Received: 26 January 2010; in revised form: 3 March 2010 / Accepted: 10 March 2010 / Published: 23 March 2010
Show/Hide Abstract
| Download PDF Full-text (317 KB) | Download XML Full-text
Abstract: In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.
|
|
Received: 27 January 2010; in revised form: 12 February 2010 / Accepted: 15 March 2010 / Published: 26 March 2010
Show/Hide Abstract
| Download PDF Full-text (188 KB) | Download XML Full-text
Abstract: This paper presents a medium access control and scheduling scheme for wireless sensor networks. It uses time trees for sending data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, time trees are built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possibly different activation rates. Through the simulation, the proposed scheme that uses time trees shows better characteristics toward burst traffic than the previous energy and data arrival rate scheme.
|
|
Received: 10 February 2010; in revised form: 25 February 2010 / Accepted: 16 March 2010 / Published: 26 March 2010
Show/Hide Abstract
| Download PDF Full-text (830 KB) | Download XML Full-text
Abstract: An Unattended Wireless Sensor Network (UWSN) can be used in many applications to collect valuable data. Nevertheless, due to the unattended nature, the sensors could be compromised and the sensor readings would be maliciously altered so that the sink accepts the falsified sensor readings. Unfortunately, few attentions have been given to this authentication problem. Moreover, existing methods suffer from different kinds of DoS attacks such as Path-Based DoS (PDoS) and False Endorsement-based DoS (FEDoS) attacks. In this paper, a scheme, called AAD, is proposed to Acquire Authentic Data in UWSNs. We exploit the collaboration among sensors to address the authentication problem. With the proper design of the collaboration mechanism, AAD has superior resilience against sensor compromises, PDoS attack, and FEDoS attack. In addition, compared with prior works, AAD also has relatively low energy consumption. In particular, according to our simulation, in a network with 1, 000 sensors, the energy consumed by AAD is lower than 30% of that consumed by the existing method, ExCo. The analysis and simulation are also conducted to demonstrate the superiority of the proposed AAD scheme over the existing methods.
|
|
Received: 11 February 2010; in revised form: 10 March 2010 / Accepted: 16 March 2010 / Published: 29 March 2010
Show/Hide Abstract
| Download PDF Full-text (1881 KB) | Download XML Full-text
Abstract: Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.
 |
|
Received: 18 January 2010; in revised form: 3 February 2010 / Accepted: 18 March 2010 / Published: 29 March 2010
Show/Hide Abstract
| Download PDF Full-text (288 KB) | Download XML Full-text
Abstract: The wireless personal area network (WPAN) is an emerging wireless technology for future short range indoor and outdoor communication applications. The IEEE 802.15.3 medium access control (MAC) is proposed to coordinate the access to the wireless medium among the competing devices, especially for short range and high data rate applications in home networks. In this paper we use analytical modeling to study the performance analysis of WPAN (IEEE 802.15.3) MAC in terms of throughput, efficient bandwidth utilization, and delay with various ACK policies under error channel condition. This allows us to introduce a K-Dly-ACK-AGG policy, payload size adjustment mechanism, and Improved Backoff algorithm to improve the performance of the WPAN MAC. Performance evaluation results demonstrate the impact of our improvements on network capacity. Moreover, these results can be very useful to WPAN application designers and protocol architects to easily and correctly implement WPAN for home networking.
|
|
Received: 28 January 2010; in revised form: 2 March 2010 / Accepted: 11 March 2010 / Published: 30 March 2010
Show/Hide Abstract
| Download PDF Full-text (615 KB) | Download XML Full-text
Abstract: In order to provide the seamless navigation and positioning services for indoor environments, an indoor location based service (LBS) test bed is developed to integrate the indoor positioning system and the indoor three-dimensional (3D) geographic information system (GIS). A wireless sensor network (WSN) is used in the developed indoor positioning system. Considering the power consumption, in this paper the ZigBee radio is used as the wireless protocol, and the received signal strength (RSS) fingerprinting positioning method is applied as the primary indoor positioning algorithm. The matching processes of the user location include the nearest neighbor (NN) algorithm, the K-weighted nearest neighbors (KWNN) algorithm, and the probabilistic approach. To enhance the positioning accuracy for the dynamic user, the particle filter is used to improve the positioning performance. As part of this research, a 3D indoor GIS is developed to be used with the indoor positioning system. This involved using the computer-aided design (CAD) software and the virtual reality markup language (VRML) to implement a prototype indoor LBS test bed. Thus, a rapid and practical procedure for constructing a 3D indoor GIS is proposed, and this GIS is easy to update and maintenance for users. The building of the Department of Aeronautics and Astronautics at National Cheng Kung University in Taiwan is used as an example to assess the performance of various algorithms for the indoor positioning system.
|
|
Received: 28 January 2010; in revised form: 20 February 2010 / Accepted: 13 March 2010 / Published: 30 March 2010
Show/Hide Abstract
| Download PDF Full-text (908 KB) | Download XML Full-text
Abstract: This paper surveys the most relevant works of Data Centric Storage (DCS) for Wireless Sensor Networks. DCS is a research area that covers data dissemination and storage inside an ad-hoc sensor network. In addition, we present a Quadratic Adaptive Replication (QAR) scheme for DCS, which is a more adaptive multi-replication DCS system and outperforms previous proposals in the literature by reducing the overall network traffic that has a direct impact on energy consumption. Finally, we discuss the open research challenges for DCS.
|
|
Received: 3 February 2010; in revised form: 8 March 2010 / Accepted: 24 March 2010 / Published: 31 March 2010
Show/Hide Abstract
| Download PDF Full-text (362 KB) | Download XML Full-text
Abstract: Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.
 |
|
Received: 21 January 2010; in revised form: 23 February 2010 / Accepted: 12 March 2010 / Published: 31 March 2010
Show/Hide Abstract
| Download PDF Full-text (378 KB) | Download XML Full-text
Abstract: Wireless multimedia sensor nodes sense areas that are uncorrelated to the areas covered by radio neighbouring sensors. Thus, node clustering for coordinating multimedia sensing and processing cannot be based on classical sensor clustering algorithms. This paper presents a clustering mechanism for Wireless Multimedia Sensor Networks (WMSNs) based on overlapped Field of View (FoV) areas. Overlapping FoVs in dense networks cause the wasting of power due to redundant area sensing. The main aim of the proposed clustering method is energy conservation and network lifetime prolongation. This objective is achieved through coordination of nodes belonging to the same cluster to perform assigned tasks in a cooperative manner avoiding redundant sensing or processing. A paradigm in this concept, a cooperative scheduling scheme for object detection, is presented based on the proposed clustering method.
|
|
Received: 8 February 2010; in revised form: 18 February 2010 / Accepted: 24 March 2010 / Published: 8 April 2010
Show/Hide Abstract
| Download PDF Full-text (687 KB) | Download XML Full-text
Abstract: The proposed mechanism for jamming attack detection for wireless sensor networks is novel in three respects: firstly, it upgrades the jammer to include versatile military jammers; secondly, it graduates from the existing node-centric detection system to the network-centric system making it robust and economical at the nodes, and thirdly, it tackles the problem through fuzzy inference system, as the decision regarding intensity of jamming is seldom crisp. The system with its high robustness, ability to grade nodes with jamming indices, and its true-detection rate as high as 99.8%, is worthy of consideration for information warfare defense purposes.
|
|
Received: 9 February 2010; in revised form: 11 March 2010 / Accepted: 18 March 2010 / Published: 12 April 2010
Show/Hide Abstract
| Download PDF Full-text (787 KB) | Download XML Full-text
Abstract: To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.
 |
|
Received: 8 March 2010; in revised form: 6 April 2010 / Accepted: 6 April 2010 / Published: 13 April 2010
Show/Hide Abstract
| Download PDF Full-text (326 KB) | Download XML Full-text
Abstract: When a sensor node roams within a very large and distributed wireless sensor network, which consists of numerous sensor nodes, its routing path and neighborhood keep changing. In order to provide a high level of security in this environment, the moving sensor node needs to be authenticated to new neighboring nodes and a key established for secure communication. The paper proposes an efficient and scalable protocol to establish and update the authentication key in a dynamic wireless sensor network environment. The protocol guarantees that two sensor nodes share at least one key with probability 1 (100%) with less memory and energy cost, while not causing considerable communication overhead.
|
|
Received: 25 January 2010; in revised form: 17 March 2010 / Accepted: 30 March 2010 / Published: 19 April 2010
Show/Hide Abstract
| Download PDF Full-text (936 KB) | Download XML Full-text
Abstract: Diabetes is difficult to control and it is important to manage the diabetic’s blood sugar level and prevent the associated complications by appropriate diabetic treatment. This paper proposes a system that can provide appropriate management for diabetes patients, according to their blood sugar level. The system is designed to send the information about the blood sugar levels, blood pressure, food consumption, exercise, etc., of diabetes patients, and manage the treatment by recommending and monitoring food consumption, physical activity, insulin dosage, etc., so that the patient can better manage their condition. The system is based on rules and the K Nearest Neighbor (KNN) classifier algorithm, to obtain the optimum treatment recommendation. Also, a monitoring system for diabetes patients is implemented using Web Services and Personal Digital Assistant (PDA) programming.
|
|
Received: 28 February 2010; in revised form: 20 March 2010 / Accepted: 5 April 2010 / Published: 30 April 2010
Show/Hide Abstract
| Download PDF Full-text (554 KB) | Download XML Full-text
Abstract: Mobility of sensor node in Wireless Sensor Networks (WSN) brings security issues such as re-authentication and tracing the node movement. However, current security researches on WSN are insufficient to support such environments since their designs only considered the static environments. In this paper, we propose the efficient node authentication and key exchange protocol that reduces the overhead in node re-authentication and also provides untraceability of mobile nodes. Compared with previous protocols, our protocol has only a third of communication and computational overhead. We expect our protocol to be the efficient solution that increases the lifetime of sensor network.
|
|
Received: 4 March 2010; in revised form: 14 April 2010 / Accepted: 16 April 2010 / Published: 4 May 2010
Show/Hide Abstract
| Download PDF Full-text (321 KB) | Download XML Full-text
Abstract: For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a multipath routing protocol (MRP) based on dynamic clustering and ant colony optimization (ACO) is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length) were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH) is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.
 |
|
Received: 10 March 2010; in revised form: 6 April 2010 / Accepted: 28 April 2010 / Published: 4 May 2010
Show/Hide Abstract
| Download PDF Full-text (829 KB) | Download XML Full-text
Abstract: Many wireless sensor network (WSN) applications require privacy-preserving aggregation of sensor data during transmission from the source nodes to the sink node. In this paper, we explore several existing privacy-preserving data aggregation (PPDA) protocols for WSNs in order to provide some insights on their current status. For this, we evaluate the PPDA protocols on the basis of such metrics as communication and computation costs in order to demonstrate their potential for supporting privacy-preserving data aggregation in WSNs. In addition, based on the existing research, we enumerate some important future research directions in the field of privacy-preserving data aggregation for WSNs.
|
|
Received: 25 March 2010; in revised form: 15 April 2010 / Accepted: 10 May 2010 / Published: 25 May 2010
Show/Hide Abstract
| Download PDF Full-text (327 KB) | Download XML Full-text
Abstract: Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization.
|
|
Received: 1 February 2010; in revised form: 1 April 2010 / Accepted: 14 May 2010 / Published: 25 May 2010
Show/Hide Abstract
| Download PDF Full-text (991 KB) | Download XML Full-text
Abstract: Future Wireless Sensor Networks (WSNs) will be ubiquitous, large-scale networks interconnected with the existing IP infrastructure. Autonomic functionalities have to be designed in order to reduce the complexity of their operation and management, and support the dissemination of knowledge within a WSN. In this paper a novel protocol for energy efficient deployment, clustering and routing in WSNs is proposed that focuses on the incorporation of autonomic functionalities in the existing approaches. The design of the protocol facilitates the design of innovative applications and services that are based on overlay topologies created through cooperation among the sensor nodes.
|
|
Received: 2 February 2010; in revised form: 12 April 2010 / Accepted: 6 May 2010 / Published: 1 June 2010
Show/Hide Abstract
| Download PDF Full-text (592 KB) | Download XML Full-text
Abstract: Battery consumption is a key aspect in the performance of wireless sensor networks. One of the most promising technologies for this type of networks is 802.15.4/ZigBee. This paper presents an empirical characterization of battery consumption in commercial 802.15.4/ZigBee motes. This characterization is based on the measurement of the current that is drained from the power source under different 802.15.4 communication operations. The measurements permit the definition of an analytical model to predict the maximum, minimum and mean expected battery lifetime of a sensor networking application as a function of the sensor duty cycle and the size of the sensed data.
|
|
Received: 9 April 2010; in revised form: 20 May 2010 / Accepted: 21 May 2010 / Published: 2 June 2010
Show/Hide Abstract
| Download PDF Full-text (789 KB) | Download XML Full-text
Abstract: The Wireless Personal Area Network (WPAN) is one of the fledging paradigms that the next generation of wireless systems is sprouting towards. Among them, a more specific category is the Wireless Body Area Network (WBAN) used for health monitoring. On the other hand, Ultra-Wideband (UWB) comes with a number of desirable features at the physical layer for wireless communications. One big challenge in adoption of UWB in WBAN is the fact that signals get attenuated exponentially. Due to the intrinsic structural complexity in human body, electromagnetic waves show a profound variation during propagation through it. The reflection and transmission coefficients of human body are highly dependent upon the dielectric constants as well as upon the frequency. The difference in structural materials such as fat, muscles and blood essentially makes electromagnetic wave attenuation to be different along the way. Thus, a complete characterization of body channel is a challenging task. The connection between attenuation and frequency of the signal makes the investigation of UWB in WBAN an interesting proposition. In this paper, we study analytically the impact of body channels on electromagnetic signal propagation with reference to UWB. In the process, scattering, reflectivity and transmitivity have been addressed with analysis of approximate layer-wise modeling, and with numerical depictions. Pulses with Gaussian profile have been employed in our analysis. It shows that, under reasonable practical approximations, the human body channel can be modeled in layers so as to have the effects of total reflections or total transmissions in certain frequency bands. This could help decide such design issues as antenna characteristics of implant devices for WBAN employing UWB.
|
|
Received: 30 April 2010; in revised form: 18 May 2010 / Accepted: 18 May 2010 / Published: 2 June 2010
Show/Hide Abstract
| Download PDF Full-text (326 KB) | Download XML Full-text
Abstract: We introduce an energy-efficient Rate Adaptive Media Access Control (RA-MAC) algorithm for long-lived Wireless Sensor Networks (WSNs). Previous research shows that the dynamic and lossy nature of wireless communications is one of the major challenges to reliable data delivery in WSNs. RA-MAC achieves high link reliability in such situations by dynamically trading off data rate for channel gain. The extra gain that can be achieved reduces the packet loss rate which contributes to reduced energy expenditure through a reduced numbers of retransmissions. We achieve this at the expense of raw bit rate which generally far exceeds the application’s link requirement. To minimize communication energy consumption, RA-MAC selects the optimal data rate based on the estimated link quality at each data rate and an analytical model of the energy consumption. Our model shows how the selected data rate depends on different channel conditions in order to minimize energy consumption. We have implemented RA-MAC in TinyOS for an off-the-shelf sensor platform (the TinyNode) on top of a state-of-the-art WSN Media Access Control Protocol, SCP-MAC, and evaluated its performance by comparing our implementation with the original SCP-MAC using both simulation and experiment.
|
|
Received: 5 February 2010; in revised form: 22 April 2010 / Accepted: 25 May 2010 / Published: 3 June 2010
Show/Hide Abstract
| Download PDF Full-text (420 KB) | Download XML Full-text
Abstract: In sensor network, energy conservation is one of the most critical issues since sensor nodes should perform a sensing task for a long time (e.g., lasting a few years) but the battery of them cannot be replaced in most practical situations. For this purpose, numerous energy conservation schemes have been proposed and duty cycling scheme is considered the most suitable power conservation technique, where sensor nodes alternate between states having different levels of power consumption. In order to analyze the energy consumption of energy conservation scheme based on duty cycling, it is essential to obtain the probability of each state. In this paper, we analytically derive steady state probability of sensor node states, i.e., sleep, listen, and active states, based on traffic characteristics and timer values, i.e., sleep timer, listen timer, and active timer. The effect of traffic characteristics and timer values on the steady state probability and energy consumption is analyzed in detail. Our work can provide sensor network operators guideline for selecting appropriate timer values for efficient energy conservation. The analytical methodology developed in this paper can be extended to other energy conservation schemes based on duty cycling with different sensor node states, without much difficulty.
|
|
Received: 19 April 2010; in revised form: 10 May 2010 / Accepted: 25 May 2010 / Published: 8 June 2010
Show/Hide Abstract
| Download PDF Full-text (722 KB) | Download XML Full-text
Abstract: In this paper four wireless sensor network operating systems are compared in terms of power consumption. The analysis takes into account the most common operating systems—TinyOS v1.0, TinyOS v2.0, Mantis and Contiki—running on Tmote Sky and MICAz devices. With the objective of ensuring a fair evaluation, a benchmark composed of four applications has been developed, covering the most typical tasks that a Wireless Sensor Network performs. The results show the instant and average current consumption of the devices during the execution of these applications. The experimental measurements provide a good insight into the power mode in which the device components are running at every moment, and they can be used to compare the performance of different operating systems executing the same tasks.
|
|
Received: 29 January 2010; in revised form: 26 April 2010 / Accepted: 20 May 2010 / Published: 9 June 2010
Show/Hide Abstract
| Download PDF Full-text (568 KB) | Download XML Full-text
Abstract: Localization is one of the most fundamental problems in wireless sensor networks, since the locations of the sensor nodes are critical to both network operations and most application level tasks. A GPS-free localization scheme for wireless sensor networks is presented in this paper. First, we develop a standardized clustering-based approach for the local coordinate system formation wherein a multiplication factor is introduced to regulate the number of master and slave nodes and the degree of connectivity among master nodes. Second, using homogeneous coordinates, we derive a transformation matrix between two Cartesian coordinate systems to efficiently merge them into a global coordinate system and effectively overcome the flip ambiguity problem. The algorithm operates asynchronously without a centralized controller; and does not require that the location of the sensors be known a priori. A set of parameter-setting guidelines for the proposed algorithm is derived based on a probability model and the energy requirements are also investigated. A simulation analysis on a specific numerical example is conducted to validate the mathematical analytical results. We also compare the performance of the proposed algorithm under a variety multiplication factor, node density and node communication radius scenario. Experiments show that our algorithm outperforms existing mechanisms in terms of accuracy and convergence time.
 |
|
Received: 1 February 2010; in revised form: 21 May 2010 / Accepted: 23 July 2010 / Published: 3 August 2010
Show/Hide Abstract
| Download PDF Full-text (1203 KB) | Download XML Full-text
Abstract: Wireless Sensor Networks (WSNs) are being deployed in very diverse application scenarios, including rural and forest environments. In these particular contexts, specimen protection and conservation is a challenge, especially in natural reserves, dangerous locations or hot spots of these reserves (i.e., roads, railways, and other civil infrastructures). This paper proposes and studies a WSN based system for generic target (animal) tracking in the surrounding area of wildlife passages built to establish safe ways for animals to cross transportation infrastructures. In addition, it allows target identification through the use of video sensors connected to strategically deployed nodes. This deployment is designed on the basis of the IEEE 802.15.4 standard, but it increases the lifetime of the nodes through an appropriate scheduling. The system has been evaluated for the particular scenario of wildlife monitoring in passages across roads. For this purpose, different schemes have been simulated in order to find the most appropriate network operational parameters. Moreover, a novel prototype, provided with motion detector sensors, has also been developed and its design feasibility demonstrated. Original software modules providing new functionalities have been implemented and included in this prototype. Finally, main performance evaluation results of the whole system are presented and discussed in depth.
 |
|
Received: 21 July 2010; in revised form: 3 August 2010 / Accepted: 3 August 2010 / Published: 8 September 2010
Show/Hide Abstract
| Download PDF Full-text (367 KB) | Download XML Full-text
Abstract: Wireless sensor networks (WSNs) generally have a many-to-one structure so that event information flows from sensors to a unique sink. In recent WSN applications, many-to-many structures evolved due to the need for conveying collected event information to multiple sinks. Privacy preserved data collection models in the literature do not solve the problems of WSN applications in which network has multiple un-trusted sinks with different level of privacy requirements. This study proposes a data collection framework bases on k-anonymity for preventing record disclosure of collected event information in WSNs. Proposed method takes the anonymity requirements of multiple sinks into consideration by providing different levels of privacy for each destination sink. Attributes, which may identify an event owner, are generalized or encrypted in order to meet the different anonymity requirements of sinks at the same anonymized output. If the same output is formed, it can be multicasted to all sinks. The other trivial solution is to produce different anonymized outputs for each sink and send them to related sinks. Multicasting is an energy efficient data sending alternative for some sensor nodes. Since minimization of energy consumption is an important design criteria for WSNs, multicasting the same event information to multiple sinks reduces the energy consumption of overall network.
|
|
Received: 16 February 2011 / Accepted: 4 March 2011 / Published: 4 March 2011
Show/Hide Abstract
| Download PDF Full-text (319 KB) | Download XML Full-text
Abstract: Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.
|
Last update: 5 April 2011
