Results 1 - 10
of
144
DFT-MSN: The Delay/Fault-Tolerant Mobile Sensor Network for Pervasive Information Gathering
- INFOCOM 2006
, 2006
"... Abstract — This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schemes tailored for DFT-MSN, which has several unique characteristics such as sensor mobility, loose connectivity, fault toler ..."
Abstract
-
Cited by 74 (6 self)
- Add to MetaCart
(Show Context)
Abstract — This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schemes tailored for DFT-MSN, which has several unique characteristics such as sensor mobility, loose connectivity, fault tolerability, delay tolerability, and buffer limit. We first study two basic approaches, namely, direct transmission and flooding. We analyze their performance by using queuing theory and statistics. Based on the analytic results that show the tradeoff between data delivery delay/ratio and transmission overhead, we introduce an optimized flooding scheme that minimizes transmission overhead in flooding. Then, we propose a simple and effective DFT-MSN data delivery scheme, which consists of two key components for data transmission and queue management, respectively. The former makes decision on when and where to transmit data messages based on the delivery probability, which reflects the likelihood that a sensor can deliver data messages to the sink. The latter decides which messages to transmit or drop based on the fault tolerance, which indicates the importance of the messages. The system parameters are carefully tuned on the basis of thorough analyses to optimize network performance. Extensive simulations are carried out for performance evaluation. Our results show that the proposed DFT-MSN data delivery scheme achieves the highest message delivery ratio with acceptable delay and transmission overhead. I.
Cluster–head Election using Fuzzy Logic for Wireless Sensor Networks”,
- ommunication Networks and Services Rearch Conference,
, 2005
"... Abstract ..."
(Show Context)
Solar-Aware clustering in wireless sensor networks
- In Proceedings of the Ninth IEEE Symposium on Computers and Communications
, 2004
"... Energy conservation plays a crucial in wireless sensor networks since such networks are designed to be placed in hostile and non-accessible areas. While battery-driven sensors will run out of battery sooner or later, the use of renewable energy sources such as solar power or gravitation may extend t ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
(Show Context)
Energy conservation plays a crucial in wireless sensor networks since such networks are designed to be placed in hostile and non-accessible areas. While battery-driven sensors will run out of battery sooner or later, the use of renewable energy sources such as solar power or gravitation may extend the lifetime of a sensor network. We propose to utilize solar power in wireless sensor networks and extend LEACH a well-known cluster-based protocol for sensor networks to become solar-aware. The presented simulation results show that making LEACH solar-aware significantly extends the lifetime of sensor networks. 1
MMAC: A Mobility-Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks
- in Proc. 24th IEEE IPCCC’05
, 2005
"... Mobility in wireless sensor networks poses unique challenges to the medium access control (MAC) protocol design. Previous MAC protocols for sensor networks assume static sensor nodes and focus on energy-effciency. In this paper, we present a mobility-adaptive, collision-free medium access control pr ..."
Abstract
-
Cited by 25 (2 self)
- Add to MetaCart
(Show Context)
Mobility in wireless sensor networks poses unique challenges to the medium access control (MAC) protocol design. Previous MAC protocols for sensor networks assume static sensor nodes and focus on energy-effciency. In this paper, we present a mobility-adaptive, collision-free medium access control protocol (MMAC) for mobile sensor networks. MMAC caters for both weak mobility (e.g., topology changes, node joins, and node failures) and strong mobility (e.g., concurrent node joins and failures, and physical mobility of nodes). MMAC is a scheduling-based protocol and thus it guarantees collision avoidance. MMAC allows nodes the transmission rights at particular timeslots based on the traffic information and mobility pattern of the nodes. Simulation results indicate that the performance of MMAC is equivalent to that of TRAMA [1] in static sensor network environments. In sensor networks with mobile nodes or high network dynamics, MMAC outperforms existing MAC protocols, like TRAMA and S-MAC [2], in terms of energy-efficiency, delay, and packet delivery.
A Unified Interference/Collision Analysis for Power-Aware Adhoc Networks
- IEEE Infocom
, 2004
"... In this paper we address the issue of controlling transmission power in power-aware adhoc networks. Previous work that minimizes the transmission power does not consider both the energy consumed in collision resolution and the energy disbursed to overcome the interference resulting from neighboring ..."
Abstract
-
Cited by 18 (3 self)
- Add to MetaCart
(Show Context)
In this paper we address the issue of controlling transmission power in power-aware adhoc networks. Previous work that minimizes the transmission power does not consider both the energy consumed in collision resolution and the energy disbursed to overcome the interference resulting from neighboring nodes. We investigate the basic transmission power control for the 802.11 MAC protocol, in which the control frames and the data frames can be transmitted at different power levels. A collision model together with an interference model of a uniformly distributed network are constructed. Based on these models, the end-to-end network throughput and the total energy consumption of the network are examined. For a network with a given node density, our results show the optimal transmission power for control messages and for data messages that will yield maximum throughput and minimum energy consumption per message.
CSN: A Network Protocol for Serving Dynamic Queries in Large-Scale Wireless Sensor Networks
- 2nd Annual Conference on Communication Networks and Services Research (CNSR 2004
, 2004
"... A fundamental problem that confronts future applications of sensor networks is how to efficiently locate the sensor node that stores a particular data item. It is known that distributed hash table (DHT) based Internet peer-topeer (P2P) protocols provide near-optimum data lookup times for queries mad ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
A fundamental problem that confronts future applications of sensor networks is how to efficiently locate the sensor node that stores a particular data item. It is known that distributed hash table (DHT) based Internet peer-topeer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes [2, 23-25]. A generic mapping of these protocols to sensor networks is, however, perceived as difficult [1]. We present a novel DHT based network protocol for sensor networks—Chord for Sensor Networks (CSN)—for which bounded times for data lookup, in the order of O(logN) messages, can be achieved in an energy efficient manner. CSN makes system lifetime of the sensor network proportional to its effective use. Furthermore, CSN scales well to large-scale sensor networks when the information about other nodes logarithmically increases with an increase in the number of sensor nodes. 1.
Peloton: Coordinated Resource Management for Sensor Networks
"... This paper makes the case that operating system designs for sensor networks should focus on the coordination of resource management decisions across the network, rather than merely on individual nodes. We motivate this view by describing the challenges inherent to achieving a globally efficient use ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
(Show Context)
This paper makes the case that operating system designs for sensor networks should focus on the coordination of resource management decisions across the network, rather than merely on individual nodes. We motivate this view by describing the challenges inherent to achieving a globally efficient use of sensor network resources, especially when the network is subject to unexpected variations in both load and resource availability. We present Peloton, a new distributed OS for sensor networks that provides mechanisms for representing distributed resource allocations, efficient state sharing across nodes, and decentralized management of network resources. We outline the Peloton OS architecture and present three sample use cases to illustrate its design. 1
A survey on the taxonomy for Cluster-based Routing Protocols for homogeneous wireless sensor networks
- ISSN 1424-8220. IJCA TM : www.ijcaonline.org
"... sensors ..."
(Show Context)
Real-Time Coordination and Routing in Wireless Sensor and Actor Networks
- In Proc. 6th Int. Conf. on Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN), Lecture Notes in Computer Science
"... Abstract. In Wireless Sensor Actor Networks (WSAN), sensor nodes perform the sensing task and actor nodes take action based on the sensed phenomena in the field. To ensure efficient and accurate operations of WSAN, new communication protocols are imperative to provide sensoractor coordination in ord ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
(Show Context)
Abstract. In Wireless Sensor Actor Networks (WSAN), sensor nodes perform the sensing task and actor nodes take action based on the sensed phenomena in the field. To ensure efficient and accurate operations of WSAN, new communication protocols are imperative to provide sensoractor coordination in order to achieve energy-efficient and reliable communication. Moreover, the protocols must honor the application-specific real-time delay bounds for the effectiveness of the actors in WSAN. In this paper, we propose a new real-time coordination and routing (RCR) framework for WSAN. It addresses the issues of coordination among sensors and actors and honors the delay bound for routing in distributed manner. RCR configures sensors to form hierarchical clusters and provides delay-constrained energy aware routing (DEAR) mechanism. It uses only cluster-heads to coordinate with sink/actors in order to save the precious energy resources. The DEAR algorithm integrates the forwardtracking and backtracking routing approaches to establish paths from source nodes to sink/actors. In the presence of the sink in WSAN, it implements the centralized version of DEAR (C-DEAR) to coordinate with the actors through the sink. In the absence of sink or ignoring its presence, there is a distributed DEAR (D-DEAR) to provide coordination among sensors and actors. Cluster-heads then select the path among multiple alternative paths to deliver the packets to the actors within the given delay bound in an efficient way. Simulation experiments prove that RCR achieves the goal to honor the realistic application-specific delay bound. 1
A configurable time-controlled clustering algorithm for wireless sensor networks
- in: 1st International Workshop on Heterogenous Wireles Sensor Networks, IEEE Computer Society
"... Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. These nodes are typically highly resource-constrained. Since the communication task is a significant power c ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. These nodes are typically highly resource-constrained. Since the communication task is a significant power consumer, there are various attempts to introduce energyawareness at different levels within the communication stack. Clustering is one such attempt to control energy dissipation for sensor data routing. Here, we propose the Time-Controlled Clustering Algorithm to realise a network-wide energy reduction by the rotation of clusterhead role, and the consideration of residual energy in its election. A realistic energy model is derived to accurately quantify the network’s energy consumption using the proposed clustering algorithm. 1.
