共查询到20条相似文献,搜索用时 31 毫秒
1.
带休眠算法的无线传感器网络MAC协议 总被引:1,自引:0,他引:1
由于无线传感器网络中每个传感器节点的能量有限,所以需要有效的MAC协议来保持能量的高效利用。在MAC协议中引入休眠算法是其中一种重要的节能方式。现有的带休眠算法的无线传感器网络MAC协议已有很多种,主要分为2大类:一类是以S-MAC协议为代表的基于休眠/监听排程方案来达到节能目的的MAC协议;另一类是以WiseMAC为代表的基于低功率信道检测方案的MAC协议。对现有的主要几种有代表性的带休眠算法的无线传感器网络MAC协议进行了描述,分析了它们各自的优缺点,并进行了对比和总结。 相似文献
2.
无线传感器网络休眠MAC协议分析 总被引:3,自引:0,他引:3
无线传感器网络中每个传感器节点一般采用电池供电,能量有限,需要有效的可休眠的MAC协议来保持能量的高效利用,因此休眠MAC协议成为研究的重要方向之一。目前已经有很多种为无线传感器网络设计的MAC协议,其中一个重要的分支就是基于局部同步周期休眠/监听排程的S-MAC协议及其各种改进协议。论文首先介绍了无线传感器网络中与MAC协议设计相关的一些特性。其次对S-MAC协议的基本原理以及各种改进协议的原理进行了说明,并分析了它们各自的优缺点。 相似文献
3.
In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while
other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling
problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique
for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away
from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of the proposed
LDS scheme. The performance of the LDS scheme is compared with that of the conventional Randomized Scheduling (RS) scheme.
It is shown that the LDS scheme yields more energy savings while maintaining a similar sensing coverage as the RS scheme for
sensor clusters. Therefore, the LDS scheme results in a longer network lifetime than the RS scheme.
Jing Deng received the B.E. and M.E. degrees in Electronic Engineering from Tsinghua University, Beijing, P. R. China, in 1994 and
1997, respectively, and the Ph.D. degree in Electrical and Computer Engineering from Cornell University, Ithaca, NY, in 2002.
Dr. Deng is an assistant professor in the Department of Computer Science at the University of New Orleans. From 2002 to 2004,
he visited the CASE center and the Department of Electrical Engineering and Computer Science at Syracuse University, Syracuse,
NY as a research assistant professor, supported by the Syracuse University Prototypical Research in Information Assurance
(SUPRIA) program. He was a teaching assistant from 1998 to 1999 and a research assistant from 1999 to 2002 in the School of
Electrical and Computer Engineering at Cornell University. His interests include mobile ad hoc networks, wireless sensor networks,
wireless network security, energy efficient wireless networks, and information assurance.
Wendi B. Heinzelman is an assistant professor in the Department of Electrical and Computer Engineering at the University of Rochester. She received
a B.S. degree in Electrical Engineering from Cornell University in 1995 and M.S. and Ph.D. degrees in Electrical Engineering
and Computer Science from MIT in 1997 and 2000 respectively. Her current research interests lie in the areas of wireless communications
and networking, mobile computing, and multimedia communication. Dr. Heinzelman received the NSF Career award in 2005 for her
work on cross-layer optimizations for wireless sensor networks, and she received the ONR Young Investigator award in 2005
for her research on balancing resource utilization in wireless sensor networks. Dr. Heinzelman was co-chair of the 1st Workshop
on Broadband Advanced Sensor Networks (BaseNets '04), and she is a member of Sigma Xi, the IEEE, and the ACM.
Yunghsiang S. Han was born in Taipei, Taiwan, on April 24, 1962. He received the B.S. and M.S. degrees in electrical engineering from the National
Tsing Hua University, Hsinchu, Taiwan, in 1984 and 1986, respectively, and the Ph.D. degree from the School of Computer and
Information Science, Syracuse University, Syracuse, NY, in 1993. From 1986 to 1988 he was a lecturer at Ming-Hsin Engineering
College, Hsinchu, Taiwan. He was a teaching assistant from 1989 to 1992 and from 1992 to 1993 a research associate in the
School of Computer and Information Science, Syracuse University. From 1993 to 1997 he was an Associate Professor in the Department
of Electronic Engineering at Hua Fan College of Humanities and Technology, Taipei Hsien, Taiwan. From 1997 to 2004 he was
with the Department of Computer Science and Information Engineering at National Chi Nan University, Nantou, Taiwan. He was
promoted to Full Professor in 1998. From June to October 2001 he was a visiting scholar in the Department of Electrical Engineering
at University of Hawaii at Manoa, HI, and from September 2002 to January 2004 he was the SUPRIA visiting research scholar
in the Department of Electrical Engineering and Computer Science and CASE center at Syracuse University, NY. He is now with
the Graduate Institute of Communication Engineering at National Taipei University, Taipei, Taiwan. His research interests
are in wireless networks, security, and error-control coding. Dr. Han is a winner of 1994 Syracuse University Doctoral Prize.
Pramod K. Varshney was born in Allahabad, India on July 1, 1952. He received the B.S. degree in electrical engineering and computer science
(with highest honors), and the M.S. and Ph.D. degrees in electrical engineering from the University of Illinois at Urbana-Champaign
in 1972, 1974, and 1976 respectively. Since 1976 he has been with Syracuse University, Syracuse, NY where he is currently
a Professor of Electrical Engineering and Computer Science and the Research Director of the New York State Center for Advanced
Technology in Computer Applications and Software Engineering. His current research interests are in distributed sensor networks
and data fusion, detection and estimation theory, wireless communications, intelligent systems, signal and image processing,
and remote sensing he has published extensively. He is the author of Distributed Detection and Data Fusion, published by Springer-Verlag
in 1997 and has co-edited two other books. Dr. Varshney is a member of Tau Beta Pi and is the recipient of the 1981 ASEE Dow
Outstanding Young Faculty Award. He was elected to the grade of Fellow of the IEEE in 1997 for his contributions in the area
of distributed detection and data fusion. In 2000, he received the Third Millennium Medal from the IEEE and Chancellor's Citation
for exceptional academic achievement at Syracuse University. He serves as a distinguished lecturer for the AES society of
the IEEE. He is on the editorial board Information Fusion. He was the President of International Society of Information Fusion
during 2001. 相似文献
4.
Jha Vivekanand Prakash Nupur Mohapatra Amar Kumar 《Wireless Personal Communications》2019,108(3):1459-1479
Wireless Personal Communications - Connectivity among deployed sensor nodes in wireless sensor network (WSN) is essential for collection and transmission of sensed data. In harsh environmental... 相似文献
5.
An Energy-Aware Geographical Forwarding Protocol Utilizing Adaptive Sleeping in Wireless Sensor Networks 总被引:1,自引:1,他引:1
MA Shu-hui JI Hong YUE Guang-xinSchool of Telecommunication Engineering Beijing University of Posts Telecommunications Beijing P.R.China 《中国邮电高校学报(英文版)》2006,13(1):15-19
1IntroductionA wireless sensor network is the combination of thephysical world and information technology.Sensor net-works can contain hundreds of thousands of cheap sens-ing nodes that work in the formof Ad Hoc networks,monitoring the environment andrepo… 相似文献
6.
7.
提出了一个容忍节点失效和时间同步误差的簇内睡眠调度算法JCSS(Intra-Cluster Sleeping scheduling),该算法不需要外部的精确时间同步机制,对不同类型的节点采用不同的调度机制,在对时间同步的估计中考虑了误差和更新.仿真实验显示在密集部署的网络环境中,该睡眠调度算法在满足网络传输性能的情况下,相对于无同步的固定时间间隔调度和有同步的固定时间间隔调度,网络生存周期分别提高了16.7%和10.5%. 相似文献
8.
Lulu Liang Xiaonan Liu Yongtao Wang Weiduan Feng Guang Yang 《Wireless Personal Communications》2014,77(2):1191-1211
A low duty-cycle operation medium access control (MAC) protocol is very important to conserve energy for resource-constrained wireless sensor networks. Traditional sleep-wake scheduling mechanisms of MAC protocols either require periodic synchronization beacons or bring high end-to-end delivery latency due to the lack of any synchronization. In this paper, we propose a low latency MAC protocol by adjusting the sleep window (SW-MAC) considering traffic patterns. Nodes in SW-MAC transmit a sequence of scout packets to wake up the next hop and estimate the traffic arrival time from upstream nodes to sleep adaptively. For the large variance traffic, we adjust the sleep window using additive increase/multiplicative decrease mechanism. And then we design a scout-based scheduling mechanism with the above algorithms to shorten the delivery latency. Simulation results indicate that SW-MAC could significantly reduce the end-to-end packet delivery latency without sacrificing energy efficiency. 相似文献
9.
为了估计传感器节点的能量开销,需要对节点功耗进行合理、准确的建模。然而,现有的节点功耗模型都没有很好地满足准确性这一要求。该文提出了一种新的基于连续参数功耗状态机的节点功耗模型,可用于任意类型传感器节点的功耗建模。该模型能够根据电源电压和工作频率等参数的变化对节点功耗进行更为准确的预测。通过对传感器节点中常用的ATmega128(L)微处理器进行实际建模并与独立的实测结果进行比较,可以发现该模型对活动状态功耗的预测误差小于1%,对空闲状态功耗的预测误差小于9.7%。该模型可用于替换传感器网络仿真工具的现有模型,为传感器节点的能量开销提供更为准确的预测结果。 相似文献
10.
11.
12.
13.
14.
Node degree is regarded as an important and convenient metric to measure the connectivity of wireless ad hoc networks. Existing studies are mainly based on the assumption that nodes are static and do not provide closed-form expressions for node degree. In this paper, we investigate three fundamental characteristics of a wireless ad hoc network: Its node degree distribution, its average node degree and its maximum node degree experienced by the nodes during their movement. We introduce a novel mathematical model to derive analytical expressions in the presence of radio channel fading. Furthermore, our results reveal that the node degree distribution follows a binomial distribution regardless of the initial distribution of nodes?? location. The results of this paper are useful to study node connectivity and to improve the algorithmic complexity of incentive protocols. 相似文献
15.
在无线传感器网络中由于节点的规模大小有限,能源问题成为目前设计的重点。根据网络中节点的不同任务特征提出了一个对传感器节点进行备份的分布式算法,使得在网络中尽可能减少工作节点的参与从而降低能耗。实验结果证明了算法的可行性和正确性,同时还给出了在特定环境下为达到网络最大持续工作时间所需节点数量的范围区间。 相似文献
16.
在无线传感器网络中由于节点的规模大小有限,能源问题成为目前设计的重点。根据网络中节点的不同任务特征提出了一个对传感器节点进行备份的分布式算法,使得在网络中尽可能减少工作节点的参与从而降低能耗。实验结果证明了算法的可行性和正确性,同时还给出了在特定环境下为达到网络最大持续工作时间所需节点数量的范围区间。 相似文献
17.
18.
In this paper, an analytical Markov model (AMM) for the IEEE 802.15.4 unslotted CSMA/CA mechanism in single-hop hierarchical wireless networks (HWN) with hidden nodes is presented. The proposed AMM is flexible enough to operate both in saturation and non-saturation regions. Its prediction accuracy was compared with that of two well known models in the literature as well as with simulation results obtained by using the network simulator (NS)-2. The comparison has indicated that when $r$ , which denotes the maximum frame retransmission attempts, is set to zero and one-tier single-hop HWN with no hidden nodes is considered, the proposed AMM predicts the simulation results with a very small mean absolute percentage error (MAPE). Similarly, when a single-hop HWN with two tiers and hidden nodes is considered, then only one of the two well known models is applicable and the proposed AMM predictions present the smallest MAPE over the simulation results. Lastly, in the case of four-tier single-hop HWN with hidden nodes, only the proposed AMM is applicable and it predicts the simulation results at a respectable level of accuracy. When $r>0$ and the unslotted mechanism continues by incrementing the number of retransmission attempt by one upon channel access failure events, only the proposed AMM can imitate the behavior of the NS-2 IEEE 802.15.4 module. 相似文献
19.
20.
无线传感器网络中异常节点检测是确保网络数据准确性和可靠性的关键步骤。基于图信号处理理论,该文提出了一种新的无线传感器网络异常节点检测定位算法。新算法首先对网络建立图信号模型,然后基于节点域-图频域联合分析的方法,实现异常节点的检测和定位。具体而言,第1步是利用高通图滤波器提取网络信号的高频分量。第2步首先将网络划分为多个子图,然后筛选出子图输出信号的特定频率分量。第3步对筛选出的子图信号进行阈值判断从而定位疑似异常的子图中心节点。最后通过比较各子图的节点集合和疑似异常节点集合,检测并定位出网络中的异常节点。实验仿真表明,与已有的无线传感器网络中异常检测方法相比,新算法不仅有着较高的异常检测概率,而且异常节点的定位率也较高。 相似文献