Results 1  10
of
301
Energy conservation in wireless sensor networks: A survey
"... In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally batterypowered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifeti ..."
Abstract

Cited by 227 (11 self)
 Add to MetaCart
In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally batterypowered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. In this paper we first break down the energy consumption for the components of a typical sensor node, and discuss the main directions to energy conservation in WSNs. Then, we present a systematic and comprehensive taxonomy of the energy conservation schemes, which are subsequently discussed in depth. Special attention has been devoted to promising solutions which have not yet obtained a wide attention in the literature, such as techniques for energy efficient data acquisition. Finally we conclude the paper with insights for research directions about energy conservation in WSNs.
AdHoc Networks Beyond Unit Disk Graphs
, 2003
"... In this paper we study a model for adhoc networks close enough to reality as to represent existing networks, being at the same time concise enough to promote strong theoretical results. The Quasi Unit Disk Graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer ..."
Abstract

Cited by 140 (11 self)
 Add to MetaCart
In this paper we study a model for adhoc networks close enough to reality as to represent existing networks, being at the same time concise enough to promote strong theoretical results. The Quasi Unit Disk Graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1. We show that  in comparison to the cost known on Unit Disk Graphs  the complexity results in this model contain the additional factor 1/d&sup2;. We prove that in Quasi Unit Disk Graphs flooding is an asymptotically messageoptimal routing technique, provide a geometric routing algorithm being more efficient above all in dense networks, and show that classic geometric routing is possible with the same performance guarantees as for Unit Disk Graphs if d 1/ # 2.
Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks
 in Wireless Mesh Networks,” in Proc. ACM MobiCom
, 2006
"... Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access sc ..."
Abstract

Cited by 140 (10 self)
 Add to MetaCart
(Show Context)
Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access scheme and RTS/CTS mechanism, 802.11 is not suitable to achieve this goal. In this paper, we investigate throughput improvements achievable by replacing CSMA/CA with an STDMA scheme where transmissions are scheduled according to the physical interference model. To this end, we present a computationally efficient heuristic for computing a feasible schedule under the physical interference model and we prove, under uniform random node distribution, an approximation factor for the length of this schedule relative to the shortest schedule possible with physical interference. This represents the first known polynomialtime algorithm for this problem with a proven approximation factor. We also evaluate the throughput and execution time of this algorithm on representative wireless mesh network scenarios through packetlevel simulations. The results show that throughput with STDMA and physicalinterferencebased scheduling can be up to three times higher than 802.11 for the parameter values simulated. The results also show that our scheduling algorithm can schedule networks with 2000 nodes in about 2.5 minutes.
Opportunitybased topology control in wireless sensor networks
 in ICDCS
, 2008
"... Topology control is an effective method to improve the energy efficiency of wireless sensor networks (WSNs). Traditional approaches are based on the assumption that a pair of nodes is either “connected ” or “disconnected”. These approaches are called connectivitybased topology control. In real envi ..."
Abstract

Cited by 139 (21 self)
 Add to MetaCart
(Show Context)
Topology control is an effective method to improve the energy efficiency of wireless sensor networks (WSNs). Traditional approaches are based on the assumption that a pair of nodes is either “connected ” or “disconnected”. These approaches are called connectivitybased topology control. In real environments however, there are many intermittently connected wireless links called lossy links. Taking a succeeded lossy link as an advantage, we are able to construct more energyefficient topologies. Towards this end, we propose a novel opportunitybased topology control. We show that opportunitybased topology control is a problem of NPhard. To address this problem in a practical way, we design a fully distributed algorithm called CONREAP based on reliability theory. We prove that CONREAP has a guaranteed performance. The worst running time is O(E) where E is the link set of the original topology, and the space requirement for individual nodes is O(d) where d is the node degree. To evaluate the performance of CONREAP, we design and implement a prototype system consisting of 50 Berkeley Mica2 motes. We also conducted comprehensive simulations. Experimental results show that compared with the connectivitybased topology control algorithms, CONREAP can improve the energy efficiency of a network up to 6 times. 1
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
, 2007
"... ..."
(Show Context)
Topology control meets sinr: the scheduling complexity of arbitrary topologies
 in Proceedings of ACM MobiHoc
, 2006
"... To date, topology control in wireless ad hoc and sensor networks—the study of how to compute from the given communication network a subgraph with certain beneficial properties—has been considered as a static problem only; the time required to actually schedule the links of a computed topology with ..."
Abstract

Cited by 103 (9 self)
 Add to MetaCart
(Show Context)
To date, topology control in wireless ad hoc and sensor networks—the study of how to compute from the given communication network a subgraph with certain beneficial properties—has been considered as a static problem only; the time required to actually schedule the links of a computed topology without message collision was generally ignored. In this paper we analyze topology control in the context of the physical SignaltoInterferenceplusNoiseRatio (SINR) model, focusing on the question of how and how fast the links of a resulting topology can actually be realized over time. For this purpose, we define and study a generalized version of the SINR model and obtain theoretical upper bounds on the scheduling complexity of arbitrary topologies in wireless networks. Specifically, we prove that even in worstcase networks, if the signals are transmitted with correctly assigned transmission power levels, the number of time slots required to successfully schedule all links of an arbitrary topology is proportional to the squared logarithm of the number of network nodes times a previously defined static interference measure. Interestingly, although originally considered without explicit accounting for signal collision in the SINR model, this static interference measure plays an important role in the analysis of link scheduling with physical link interference. Our result thus bridges the gap between static graphbased interference models and the physical SINR model. Based on these results, we also show that when it comes to scheduling, requiring the communication links to be symmetric may imply significantly higher costs as opposed to topologies allowing unidirectional links.
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
, 2007
"... In this paper we discuss a selection of promising and interesting research areas in the design of protocols and systemsforwirelessindustrialcommunications.Wehaveselected topicsthathaveeitheremergedashottopicsintheindustrial communicationscommunityinthelastfewyears(likewireless sensornetworks),orwhi ..."
Abstract

Cited by 96 (1 self)
 Add to MetaCart
(Show Context)
In this paper we discuss a selection of promising and interesting research areas in the design of protocols and systemsforwirelessindustrialcommunications.Wehaveselected topicsthathaveeitheremergedashottopicsintheindustrial communicationscommunityinthelastfewyears(likewireless sensornetworks),orwhichcouldbeworthwhileresearchtopicsin thenextfewyears(forexamplecooperativediversitytechniques for error control, cognitive radio/opportunistic spectrum access for mitigation of external interferences).
Energyefficient cloud computing
 Comput. J
, 2010
"... Abstract. Energy efficiency is increasingly important for future information and communication technologies (ICT), because the increased usage of ICT, together with increasing energy costs and the need to reduce green house gas emissions call for energyefficient technologies that decrease the over ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Energy efficiency is increasingly important for future information and communication technologies (ICT), because the increased usage of ICT, together with increasing energy costs and the need to reduce green house gas emissions call for energyefficient technologies that decrease the overall energy consumption of computation, storage and communications. Cloud computing has recently received considerable attention, as a promising approach for delivering ICT services by improving the utilization of datacentre resources. In principle, cloud computing can be an inherently energyefficient technology for ICT provided that its potential for significant energy savings that have so far focused on hardware aspects, can be fully explored with respect to system operation and networking aspects. Thus this paper reviews the usage in the context of Cloud Computing, of methods and technologies currently used for energyefficient operation of computer hardware and network infrastructure. After surveying some of the current best practice and relevant literature in this area, this paper identifies some of the remaining key research challenges that arise when such energy saving techniques are extended for use in Cloud Computing environments.
Randomized 3D Geographic Routing
"... Abstract—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing decision solely on its local view of the network, nodes do not store any message state, and the message itself can ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
(Show Context)
Abstract—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing decision solely on its local view of the network, nodes do not store any message state, and the message itself can only carry information about O(1) nodes. In geographic routing schemes, each network node is assumed to know the coordinates of itself and all adjacent nodes, and each message carries the coordinates of its target. Whereas many of the aspects of geographic routing have already been solved for 2D networks, little is known about higherdimensional networks. It has been shown only recently that there is in fact no local memoryless routing algorithm for 3D networks that delivers messages deterministically. In this paper, we show that a cubic routing stretch constitutes a lower bound for any local memoryless routing algorithm, and propose and analyze several randomized geographic routing algorithms which work well for 3D network topologies. For unit ball graphs, we present a technique to locally capture the surface of holes in the network, which leads to 3D routing algorithms similar to the greedyfacegreedy approach for 2D networks. I.