ArticlePDF Available

Abstract and Figures

The optimal Base Station (BS) location can improve the network lifetime in Wireless Sensor Network (WSN). In this paper, we proposed a new approach called node partitioning technique to find out the optimum BS locations. This new approach provides a good insight of BS location problem. An algorithm is also proposed based on this approach in our paper.
Content may be subject to copyright.
A preview of the PDF is not available
... The basic goal of this Project is to provide museum information services in an "effective and timely" manner. With completion of wireless network infrastructure that can collect information from a physical environment [5], and active push service through cell phones over WLAN will be the next initiative. ...
Article
Full-text available
Based on abundant artifact collections together with the employment of Radio Frequency Identification (RFID) and wireless networking technologies, NPM has been implementing Ubiquitous Project with aims to transform NPM from a traditional museum into a U-Museum and to assist domestic cultural and creative industries in reaching out the world. New technologies also facilitate other missions such as public service, ticketing, digital value-added applications and cultural creativity, while advanced digital technologies bring new excitement and visiting experience to the audience. This essay will highlight the project for digital value-added application in marketing and licensing department of NPM.
... A disperse network is a network that contains geographically disperse nodes located far away from the majority of the nodes. In case of a disperse network, the traditional approaches3456789101112, are not suitable as network lifetime is drastically reduced due to the presence of a disperse node(s). Therefore, we come up with a new design scheme called LEDN. ...
Article
Full-text available
In energy constrained Wireless Sensor Networks (WSN), network lifetime is considered as one of the most important metrics from the design point of view. In our paper, we have addressed the impact of a disperse node on network lifetime and have proposed a new design approach, Lifetime Enhancement for Disperse Networks (LEDN) to reduce its effect on a two tiered WSN. A mathematical analysis has also been presented in our paper to discuss the impact of a disperse node on network lifetime. Simulation studies confirm the significant improvement in network lifetime using our proposed design scheme.
Conference Paper
Full-text available
The paper investigates an anycast communication paradigm for a hybrid sensor/actuator network, consisting of both resource-rich and resource-impoverished devices. The key idea is to exploit the capabilities of resource-rich devices (called micro-servers) to reduce the communication burden on smaller sensor nodes which are energy, bandwidth and memory constrained. The goal is to deliver sensor data to the nearest micro-server, which can (i) store it, (ii) forward it to other micro-servers using out-of-band communication, or (iii) perform the desired actuation. Our approach is to construct an anycast tree rooted at each potential event source, which micro-servers can dynamically join and leave. Our anycast mechanism is self-organizing, distributed, robust, scalable, and incurs very little overhead. Simulations using ns-2 show that our anycast mechanism can reduce network energy consumption by more than 50%, both the mean end-to-end latency of the transmission and the mean number of transmissions by more than 50%, and achieves 99% data delivery rate for low and moderate micro-server mobility rate.
Conference Paper
Full-text available
Position information of individual nodes is useful in implementing functions such as routing and querying in ad-hoc networks. Deriving position information by using the capability of the nodes to measure time of arrival (TOA), time difference of arrival (TDOA), angle of arrival (AOA) and signal strength have been used to localize nodes relative to a frame of reference. The nodes in an ad-hoc network can have multiple capabilities and exploiting one or more of the capabilities can improve the quality of positioning. In this paper, we show how AOA capability of the nodes can be used to derive position information. We propose a method for all nodes to determine their orientation and position in an ad-hoc network where only a fraction of the nodes have positioning capabilities, under the assumption that each node has the AOA capability.
Book
A one-stop resource for the use of algorithms and protocols in wireless sensor networks. From an established international researcher in the field, this edited volume provides readers with comprehensive coverage of the fundamental algorithms and protocols for wireless sensor networks. It identifies the research that needs to be conducted on a number of levels to design and assess the deployment of wireless sensor networks, and provides an in-depth analysis of the development of the next generation of heterogeneous wireless sensor networks. Divided into nineteen succinct chapters, the book covers: mobility management and resource allocation algorithms; communication models; energy and power consumption algorithms; performance modeling and simulation; authentication and reputation mechanisms; algorithms for wireless sensor and mesh networks; and algorithm methods for pervasive and ubiquitous computing; among other topics. Complete with a set of challenging exercises, this book is a valuable resource for electrical engineers, computer engineers, network engineers, and computer science specialists. Useful for instructors and students alike, Algorithms and Protocols for Wireless Sensor Networks is an ideal textbook for advanced undergraduate and graduate courses in computer science, electrical engineering,and network engineering.
Article
The main goal of topology control in wireless sensor networks is to reduce interference between competing signals and thus extend the battery life of sensor devices by minimizing retransmission of data. This paper proposes an algorithm, Low Bounded Interference Control, to minimize the lower and upper bounds on interference. The lower bound refers to the degree of any node, while the upper bound consists of both degree as well as the size of the critical node set. The critical node set of a node u consists of those nodes that are not its immediate neighbors but can cause interference at node u because u is within their transmission range. Our algorithm uses a robust model for interference measurement, and works well in situations where there is high interference on a node due to its immediate and critical node set. By analyzing the two-dimensional node distribution we show how our algorithm guarantees the construction of a connectivity-preserving topology with minimal interference in polynomial time.
Article
This paper argues that a camera sensor network containing hetero-geneous elements provides numerous benefits over traditional ho-mogeneous sensor networks. We present the design and implemen-tation of SensEye–a multi-tier network of heterogeneous wireless nodes and cameras. To demonstrate its benefits, we implement a surveillance application using SensEye comprising three tasks: ob-ject detection, recognition and tracking. We propose novel mech-anisms for low-power low-latency detection, low-latency wakeups, efficient recognition and tracking. Our techniques show that a multi-tier sensor network can reconcile the traditionally conflicting sys-tems goals of latency and energy-efficiency. An experimental eval-uation of our prototype shows that, when compared to a single-tier prototype, our multi-tier SensEye can achieve an order of magni-tude reduction in energy usage while providing comparable surveil-lance accuracy.
Conference Paper
In this position paper, we examine recent technology trends that have resulted in a broad spectrum of camera sensors, wireless radio technologies, and embedded sensor platforms with varying capabilities. We argue that future sensor applications will be hierarchical with multiple tiers, where each tier employs sensors with different characteristics. We argue that multi-tier networks are not only scalable, they offer a number of advantages over simpler, single-tier unimodal networks: lower cost, better coverage, higher functionality, and better reliability. However, the design of such mixed networks raises a number of new challenges that are not adequately addressed by current research. We discuss several of these challenges and illustrate how they can be addressed in the context of SensEye, a multi-tier video surveillance application that we are designing in our research group.
Conference Paper
In this paper, we present a minimum spanning tree (MST) based topology control algorithm, called local minimum spanning tree (LMST), for wireless multi-hop networks. In this algorithm, each node builds its local minimum spanning tree independently and only keeps on-tree nodes that are one-hop away as its neighbors in the final topology. We analytically prove several important properties of LMST: (1) the topology derived under LMST preserves the network connectivity; (2) the node degree of any node in the resulting topology is bounded by 6; and (3) the topology can be transformed into one with bidirectional links (without impairing the network connectivity) after removal of all uni-directional links. These results are corroborated in the simulation study.
Article
We consider generic two-tiered wireless sensor networks (WSNs) consisting of sensor clusters deployed around strategic locations, and base-stations (BSs) whose locations are relatively flexible. Within a sensor cluster, there are many small sensor nodes (SNs) that capture, encode, and transmit relevant information from a designated area, and there is at least one application node (AN) that receives raw data from these SNs, creates a comprehensive local-view, and forwards the composite bit-stream toward a BS. This paper focuses on the topology control process for ANs and BSs, which constitute the upper tier of two-tiered WSNs. Since heterogeneous ANs are battery-powered and energy-constrained, their node lifetime directly affects the network lifetime of WSNs. By proposing algorithmic approaches to locate BSs optimally, we can maximize the topological network lifetime of WSNs deterministically, even when the initial energy provisioning for ANs is no longer always proportional to their average bit-stream rate. The obtained optimal BS locations are under different lifetime definitions according to the mission criticality of WSNs. By studying intrinsic properties of WSNs, we establish the upper and lower bounds of maximal topological lifetime, which enable a quick assessment of energy provisioning feasibility and topology control necessity. Numerical results are given to demonstrate the efficacy and optimality of the proposed topology control approaches designed for maximizing network lifetime of WSNs.
Article
Energy constraints have a significant impact on the design and operation of wireless sensor networks. This paper investigates the base station (BS) selection (or anycast) problem in wireless sensor networks. A wireless sensor network having multiple BSs (data sink nodes) is considered. Each source node must send all its locally generated data to only one of the BSs. To maximize network lifetime, it is essential to optimally match each source node to a particular BS and find an optimal routing solution. A polynomial time heuristic is proposed for optimal BS selection and anycast via a sequential fixing procedure. Through extensive simulation results, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution