The proceedings contain 17 papers. The special focus in this conference is on Algorithmic Aspects of Wireless sensor Networks. The topics include: Algorithm design and optimization for sensorsystems;algorithmic and f...
ISBN:
(纸本)3540224769
The proceedings contain 17 papers. The special focus in this conference is on Algorithmic Aspects of Wireless sensor Networks. The topics include: Algorithm design and optimization for sensorsystems;algorithmic and foundational aspects of sensorsystems;on a conjecture related to geometric routing;wiseMAC;on the computational complexity of sensor network localization;a distributed TDMA slot assignment algorithm for wireless sensor networks;balanced data gathering in energy-constrained sensor networks;scale free aggregation in sensor networks;the expected uncertainty of range free localization protocols in sensor networks;towards a dynamical model for wireless sensor networks;efficient delivery of information in sensor networks using smart antennas;neighborhood-based topology recognition in sensor networks;a novel fault tolerant and energy-aware based algorithm for wireless sensor networks;route discovery with constant memory in oriented planar geometric networks;probabilistic model for energy estimation in wireless sensor networks;a hybrid adaptive dissemination protocol for wireless sensor networks and constrained flow optimization with applications to data gathering in sensor networks.
Summary form only given, as follows. Multi-channel and mobile applications are becoming a main challenge in conceiving, designing, and releasing next-generation information systems. New technologies, like Wi-fi networ...
详细信息
A wireless sensor network deployed in an area of interest is affected by variations in environmental conditions associated with that area. It must adapt to these variations in order to continue functioning as desired ...
详细信息
ISBN:
(纸本)0769522084
A wireless sensor network deployed in an area of interest is affected by variations in environmental conditions associated with that area. It must adapt to these variations in order to continue functioning as desired by the user We present a novel, two-phase solution to the wireless sensor network adaptivity problem. In the first phase, nodes in the network, organized as clusters, execute an efficient algorithm to dynamically calibrate sensed data. Each node provides its current energy level and the state of each on-board sensor to a cluster-head. In the second phase, each cluster-head executes an efficient, ontology-driven algorithm to determine the future state of the network under existing conditions, based on information received from each sensor node. We describe an example application scenario to show how our two-phase solution can be employed to enable a real-world wireless sensor network to adapt itself to variations in environmental conditions.
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use ...
详细信息
ISBN:
(纸本)9781450377959
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.
Based on the current standardized ieee 802.11 distributed coordination function (DCF) protocol, this paper proposes a new efficient collision resolution mechanism, called GDCF. Our main motivation is based on the obse...
详细信息
ISBN:
(纸本)0769522211
Based on the current standardized ieee 802.11 distributed coordination function (DCF) protocol, this paper proposes a new efficient collision resolution mechanism, called GDCF. Our main motivation is based on the observation that 802.11 DCF decreases the contention window to the initial value after each success transmission, which essentially assume's that each successful transmission is an indication that the system is under low traffic loading. GDCF takes a more conservative measure by halving the contention window size after c consecutive successful transmissions. This "gentle" decrease can reduce the collision probability, especially when the number of competing nodes is large. We compute the optimal value for c, and the numerical results from both analysis and simulation demonstrate that GDCF significantly improve the performance of 802.11 DCF including throughput, fairness, and energy efficiency. In addition, GDCF is flexible for supporting priority access by selecting different values of c for different traffic types;it is very easy to implement it, as it does not requires any changes in control message structure and access procedures in DCF.
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clusterhead such that all nodes within unit...
详细信息
ISBN:
(纸本)0769522211
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clusterhead such that all nodes within unit distance of the clusterhead belong to the cluster but no node beyond distance m from the clusterhead belongs to the cluster. By asserting m greater than or equal to 2, FLOC achieves locality: effects of cluster formation and faults/changes at any part of the network are contained within at most m units. By taking unit distance to be the reliable communication radius and m to be the maximum communication radius, FLOC exploits the double-band nature of wireless radio-model and achieves clustering in constant time regardless of the network size. Through simulations and experiments with actual deployments, we analyze the tradeoffs between clustering time and the quality of clustering, and suggest suitable parameters for FLOC to achieve a fast completion time without compromising the quality of the resulting clustering.
Wireless sensor networks (WSNs) are appealing in obtaining fine-granular observations about the physical world. Due to the fact that WSNs are composed of a large number of low-cost but energy-constrained sensor nodes,...
详细信息
ISBN:
(纸本)0769522335
Wireless sensor networks (WSNs) are appealing in obtaining fine-granular observations about the physical world. Due to the fact that WSNs are composed of a large number of low-cost but energy-constrained sensor nodes, along with the notorious timer-varying and error-prone natures of wireless links, scalable, robust, and energy-efficient data disseminating techniques are requisite for the emerging WSN applications such as environment monitoring and surveillance. In this paper we examine this emerging field from a view of supply chain management and propose a hybrid data dissemination framework for WSNs. In particular, we conceptually partition a whole sensor field into several functional regions based on the supply chain management methodology, and apply different routing schemes to different regions in order to provide better performance in terms of reliability and energy usage. For this purpose, we also propose a novel zone flooding scheme, essentially a combination of geometric routing and flooding techniques. Our hybrid data dissemination framework features low overhead, high reliability, good scalability and flexibility, and preferable energy efficiency. Detailed simulation studies are carried out to validate the effectiveness and efficiency of our scheme.
In-network data gathering and data fusion are essential for the efficient operation of wireless sensor networks. While most existing data gathering routing protocols addressed the issue of energy efficiency, few of th...
详细信息
ISBN:
(纸本)0769522211
In-network data gathering and data fusion are essential for the efficient operation of wireless sensor networks. While most existing data gathering routing protocols addressed the issue of energy efficiency, few of them, however, have considered the quality of the implied data aggregation process. In this work, an information model for sensed data is first formulated. A new metric for evaluating data aggregation process, Data Aggregation Quality (DAQ), is formally derived. DAQ does not assume any prior knowledge on values or on statistical distributions of sensing data, and may be applied to most data gathering protocols. Next, two new protocols are proposed: the Enhanced LEACH and the Clustered PEGASIS, enhanced from two major existing protocols: the cluster-based LEACH and the chain based PEGASIS. By carefully accounting for listening energy, energy efficiency of all four protocols is evaluated. In addition, DAQ is applied to evaluate their data aggregation process. It is found that, while chain-based protocols are more energy efficient than cluster-based protocols, they however suffer from poor data aggregation quality. DAQ may be readily applied to most of continuous data gathering protocols;it is therefore significant to future development of sensor network protocols.
Identity management (IdM) will be a critical factor in the progress of distributedcomputingsystems. Grid computing, defined as "coordinated resource sharing and problem solving in dynamic, multi-institutional v...
详细信息
Identity management (IdM) will be a critical factor in the progress of distributedcomputingsystems. Grid computing, defined as "coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations," reflects a desire to open network and computing resources to widespread sharing and collaboration. The desire for resource sharing and virtual forms of organization reinforces the need for reliable, scalable forms of identification, authentication, and authorization.
A high-density wireless sensor network can be deployed for specific information-gathering. In such a network, sensors need to route their sensed data to a base station, consuming highly-limited and unreplenishable ene...
详细信息
ISBN:
(纸本)0769522084
A high-density wireless sensor network can be deployed for specific information-gathering. In such a network, sensors need to route their sensed data to a base station, consuming highly-limited and unreplenishable energy resource. Hence, one of the most critical issues in designing sensor data gathering algorithms is to minimize the energy consumption for network longevity while meeting certain requirements given, such as delay constraints, which may vary depending on specific applications or environmental situations. In this paper we propose a novel two-phase clustering (TPC) scheme for energy-saving and delay-adaptive data gathering in wireless sensor networks. The proposed scheme partitions the network into clusters in phase I, each with a cluster head, forming a direct link between cluster member and cluster head. In phase II, each cluster member searches for a neighbor closer than the cluster head within the cluster to set up an energy-saving data relay link. The sensors use either the direct link or the data relay link for their sensed data forwarding depending on the requirements specified by the users or applications. Simulation results show that the TPC reduces average transmission distance by up to 75% with the help of data relay links when there is no delay constraint, implying that there is a significant amount of energy-savings in collecting sensed data.
暂无评论