共查询到20条相似文献,搜索用时 15 毫秒
1.
Wireless sensor networks can be used to monitor the interested region by multi-hop communication. Since sensor nodes are equipped
with energy-limited batteries, energy conservation in such networks is of paramount importance in order to prolong the network
lifetime. In this paper, considering the constrained radio range of node, we propose an energy efficient clustering division
scheme from the viewpoint of energy consumption. The difference between our scheme and previous schemes is that ours is a
non-uniform clustering hierarchy. With the algorithm that is proposed by this paper, we can divide the cluster into multiple
non-uniform concentric rings and obtain the optimal thickness of each ring. Motivated by the derived results, every sensor
node can adjust its radio range for transmission. Our extensive simulation results indicate that the proposed non-uniform
clustering division scheme outperforms the conventional uniform clustering division schemes in terms of energy consumption
and lifetime. The future research that should be explored is also discussed finally.
相似文献
Yan JinEmail: |
2.
This paper proposes an opportunistic data aggregation algorithm to support the data collection in low-duty-cycle Wireless sensor networks (WSNs) with unreliable links. In this algorithm, each sensor selectively waits for some certain time to maximize the number of packets that it can aggregate from its downstream nodes, then transmits the aggregated result to an adaptively selected upstream node following an optimal forwarding sequence. Simulation results show that the algorithm can significantly increase the data aggregation efficiency, and reduce energy consumption and message overhead. 相似文献
3.
无线传感器网络中协作通信的能耗优化方法研究 总被引:2,自引:0,他引:2
针对能量受限的无线传感器网络,该文综合考虑了协作节点数量和调制方式对系统能量有效性的影响,提出一种能量最优的综合优化方法。文中首先给出了在Rayleigh衰落信道环境下,协作通信系统采用二相相移键控(BPSK)和M进制正交幅度调制(MQAM)时误码率的闭式表达,同时对协作通信的系统能耗进行了分析。在此基础上,根据能耗最小化原则对协作节点数量和调制方式进行了联合优化。仿真结果表明,与调制方式固定或协作节点数固定的系统相比,该方案能进一步降低协作通信的系统能耗。 相似文献
4.
An Energy Conservation MAC Protocol in Wireless Sensor Networks 总被引:1,自引:1,他引:0
Wireless sensor networks use battery-operated computing and sensing devices. Because of the limitation of battery power in
the sensor nodes, energy conservation is a crucial issue in wireless sensor networks. Consequently, there is much literature
presenting energy-efficient MAC protocols based on active/sleep duty cycle mechanisms to conserve energy. Convergecast is
a common communication pattern across many sensor network applications featuring data gathering from many different source
nodes to a single sink node. This leads to high data collision rates, high energy consumption, and low throughput near the
sink node. This paper proposes an efficient slot reservation MAC protocol to reduce energy consumption and to make transmission
more efficient in data gathering wireless sensor networks. The simulation results show that our protocol provides high throughput,
low delivery latency and low energy consumption compared to other methods.
相似文献
Jang-Ping SheuEmail: |
5.
一维无线传感器网络分簇通信方案能量效率研究 总被引:1,自引:0,他引:1
为了提高无线传感器网络的能量有效性,该文在分析基于分簇的传统方案和协作分集数据传输方案的能量效率基础上,提出了一维传感器网络分簇多用户分集数据传送方案(CMDDTS)。理论分析表明能量开销依赖于数据融合比、簇内通信的发送功率、簇间通信的接收功率以及电路消耗的功率和簇内传感器的数目,仿真结果验证了所提方案的能量效率优于传统方案和协作分集数据传送方案。 相似文献
6.
无线传感器网络由许多具有低功率无线收发装置的传感器节点组成,能够有效地从不同环境监测收集周边环境信息并传送到远处的基站进行处理.由于传感器节点的电池能量极为有限,因此节点的通信应有效的利用能量,以延长网络的生命周期.LEACH[4]协议是一种典型的能有效延长网络生命周期的节能通信协议.本文提出了一种分布的、高效节能的通信协议DEED,DEED利用了数据聚合技术,以聚类的方式组织节点,聚类首领在网络中均匀分布并组织成路由树,由根节点与基站直接通信.实验结果显示DEED性能远好于LEACH. 相似文献
7.
文章研究了无线传感器网络中协作自动请求重传(Cooperative Automatic Repeat Request, CARQ)协议的能量效率及其优化问题。定义协议的能量效率为单位能耗所支持的分组成功传输的个数,导出了CARQ协议和传统ARQ协议的能量效率表达式以及CARQ协议相对ARQ协议的能效增益表达式,依此对两协议的能量效率进行了仿真研究,发现协作节点的位置对协议的能量效率有重要影响,当通信距离大于“门限距离”时,CARQ协议的能量效率才高于传统ARQ协议能效;进而提出了一种离散优化算法,通过优化调制水平,大大提高了CARQ协议的能效及能效增益。 相似文献
8.
9.
The majority of the energy consumption by the sensors is the energy requirement for data transmission in Wireless Sensor Networks (WSNs). Therefore, introducing mobile collectors to collect data instead of multi-hop data relay is essential. However, for many proposed data gathering approaches, long data delay is the main problem. Hence, the problem of how to decrease the energy consumption and the data delay needs to be solved. In this paper, a low delay data collection mechanism using multiple mobile collectors is proposed. First, a self-organization clustering algorithm is designed. Second, sensor nodes are organized into three-level clusters. Then a collection strategy based on the hierarchical structure is proposed, which includes two rules to dispatch mobile collectors rationally. Simulation results show that the proposed mechanism is superior to other existing approaches in terms of the reduction in energy expenditure and the decrease in data delay. 相似文献
10.
To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme with fairness or ISWF for short. In ISWF, a quick congestion detection method, which combines the queue length with traffic changes of a node, is used to solve the slow congestion detection problem, and a new solution, which adjusts the rate of sending data of a node by monitoring the channel utilization rate, is used to solve the slow convergence problem. At the same time, the probability selection method is used in ISWF to achieve the fairness of channel bandwidth utilization. Experiment and simulation results show that ISWF can effectively reduce the reaction time in detecting congestion and shorten the rate convergence process. Compared with the existing tree-based fair data collection schemes, ISWF can achieve better fairness in data collection and reduce the transmission delay effectively, and at the same time, it can increase the average network throughput by 9.1% or more. 相似文献
11.
12.
Range-Based Sleep Scheduling (RBSS) for Wireless Sensor Networks 总被引:3,自引:0,他引:3
Sleep scheduling in a wireless sensor network is the process of deciding which nodes are eligible to sleep (enter power-saving
mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem
require sensor’s location information, which may be impractical considering costly locating overheads. This paper proposes
range-based sleep scheduling (RBSS) protocol which needs sensor-to-sensor distance but no location information. RBSS attempts
to approach an optimal sensor selection pattern that demands the fewest working (awake) sensors. Simulation results indicate
that RBSS is comparable to its location-based counterpart in terms of coverage quality and the reduction of working sensors.
相似文献
Yang-Min ChengEmail: |
13.
基于感知距离调节的无线传感器网络节能区域覆盖 总被引:4,自引:1,他引:3
传感器节点能够感知的物理世界的最远距离称为节点的感知距离。该文研究了基于节点感知距离调节的无线传感器网络节能区域覆盖方案,该方案通过设定合理的节点感知距离,使得传感器网络在满足区域覆盖要求的同时,能量消耗最低。首先将区域覆盖性能和网络能量消耗模化成网络节点感知距离的函数,然后将节能覆盖问题模化成带约束条件的优化问题,最后给出了基于网络区域划分的优化模型求解方法。仿真结果表明,与传统覆盖方案比较,所提方案在满足覆盖要求的同时,有效降低了网络能量消耗。 相似文献
14.
针对某些特定场合无线传感器网络中传感器产生的数据时间和空间上的冗余和高度相关性,提出了一种面向数据相关性及权重的传感器网络采样优化算法DCACW。它基于聚合树结构连接整个网络,在各节点根据样本的相关性和节点权重进行数据融合。仿真实验结果表明,本算法采集的样本覆盖度更广,而且在聚合树中去除了冗余和相关的数据,保证了最终收集的样本差异性较强。 相似文献
15.
16.
无线传感器网络中覆盖问题的研究 总被引:3,自引:0,他引:3
简要介绍了无线传感器网络体系结构、特点和应用领域.针对无线传感器网络节点覆盖问题进行了研究,提出了基于最短路径的覆盖算法,并给出了仿真结果. 相似文献
17.
Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks 总被引:3,自引:1,他引:2
Sushant Jain Rahul C. Shah Waylon Brunette Gaetano Borriello Sumit Roy 《Mobile Networks and Applications》2006,11(3):327-339
We analyze an architecture based on mobility to address the problem of energy efficient data collection in a sensor network.
Our approach exploits mobile nodes present in the sensor field as forwarding agents. As a mobile node moves in close proximity
to sensors, data is transferred to the mobile node for later depositing at the destination. We present an analytical model
to understand the key performance metrics such as data transfer, latency to the destination, and power. Parameters for our
model include: sensor buffer size, data generation rate, radio characteristics, and mobility patterns of mobile nodes. Through
simulation we verify our model and show that our approach can provide substantial savings in energy as compared to the traditional
ad-hoc network approach.
Sushant Jain is a Ph.D. candidate in the Department of Computer Science and Engineering at the University of Washington. His research
interests are in design and analysis of routing algorithms for networking systems. He received a MS in Computer Science from
the University of Washington in 2001 and a B.Tech degree in Computer Science from IIT Delhi in 1999.
Rahul C. Shah completed the B. Tech (Hons) degree from the Indian Institute of Technology, Kharagpur in 1999 majoring in Electronics and
Electrical Communication Engineering. He is currently pursuing his Ph.D. in Electrical Engineering at the University of California,
Berkeley. His research interests are in energy-efficient protocol design for wireless sensor/ad hoc networks, design methodology
for protocols and next generation cellular networks.
Waylon Brunette is a Research Engineer in the Department of Computer Science and Engineering at the University of Washington. His research
interests include mobile and ubiquitous computing, wireless sensor networks, and personal area networks. Currently, he is
engaged in collaborative work with Intel Research Seattle to develop new uses for embedded devices and RFID technologies in
ubiquitous computing. He received a BS in Computer Engineering from the University of Washington in 2002.
Gaetano Borriello is a Professor in the Department of Computer Science and Engineering at the University of Washington. His research interests
are in embedded and ubiquitous computing, principally new hardware devices that integrate seamlessly into the user’s environment
with particular focus on location and identification systems. His principal projects are in creating manageable RFID systems
that are sensitive to user privacy concerns and in context-awareness through sensors distributed in the environment as well
as carried by users.
Sumit Roy received the B. Tech. degree from the Indian Institute of Technology (Kanpur) in 1983, and the M. S. and Ph. D. degrees from
the University of California (Santa Barbara), all in Electrical Engineering in 1985 and 1988 respectively, as well as an M.
A. in Statistics and Applied Probability in 1988. His previous academic appointments were at the Moore School of Electrical
Engineering, University of Pennsylvania, and at the University of Texas, San Antonio. He is presently Prof, of Electrical
Engineering, Univ. of Washington where his research interests center around analysis/design of communication systems/networks,
with a topical emphasis on next generation mobile/wireless networks. He is currently on academic leave at Intel Wireless Technology
Lab working on high speed UWB radios and next generation Wireless LANs. His activities for the IEEE Communications Society
includes membership of several technical committees and TPC for conferences, and he serves as an Editor for the IEEE Transactions
on Wireless Communications. 相似文献
18.
Dajin Wang 《International Journal of Wireless Information Networks》2008,15(2):61-71
We study the problem of assigning clusterheads in a hierarchical Wireless Sensor Network (WSN). That is, for a given hierarchical
WSN, how many clusterhead nodes we should assign, and how to geographically allocate these clusterheads. Since an assignment
scheme optimizing all factors is impossible, we will focus on the crucial issue of energy efficiency of the WSN. Because it
is mostly true that the nodes of WSN are powered by batteries, power saving is an especially important consideration in WSN
architecture design. We will propose a hierarchical WSN architecture toward the end of saving energy of both sensor nodes
and clusterheads. Using analytical result, experiments are conducted in which realistic scenarios are simulated.
相似文献
Dajin WangEmail: |
19.