共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime. 相似文献
3.
4.
Wireless sensor and actor networks (WSANs) have been increasingly popular for environmental monitoring applications in the last decade. While the deployment of sensor nodes enables a fine granularity of data collection, resource-rich actor nodes provide further evaluation of the information and reaction. Quality of service (QoS) and routing solutions for WSANs are challenging compared to traditional networks because of the limited node resources. WSANs also have different QoS requirements than wireless sensor networks (WSNs) since actors and sensor nodes have distinct resource constraints.In this paper, we present, LRP-QS, a lightweight routing protocol with dynamic interests and QoS support for WSANs. LRP-QS provides QoS by differentiating the rates among different types of interests with dynamic packet tagging at sensor nodes and per flow management at actor nodes. The interests, which define the types of events to observe, are distributed in the network. The weights of the interests are determined dynamically by using a nonsensitive ranking algorithm depending on the variation in the observed values of data collected in response to interests. Our simulation studies show that the proposed protocol provides a higher packet delivery ratio and a lower memory consumption than the existing state of the art protocols. 相似文献
5.
Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply 总被引:2,自引:0,他引:2
Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency
is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and
propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take
into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when
making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy
based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy
on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both
GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance.
Kai Zeng received his B.E. degree in Communication Engineering and M.E. degree in Communication and Information System both from Huazhong
University of Science and Technology, China, in 2001 and 2004, respectively. He is currently a Ph.D. student in the Electrical
and Computer Engineering department at Worcester Polytechnic Institute. His research interests are in the areas of wireless
ad hoc and sensor networks with emphases on energy-efficient protocol, cross-layer design, routing, and network security.
Kui Ren received his B. Eng. and M. Eng. both from Zhejiang University, China, in 1998 and 2001, respectively. He worked as a research
assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences from March 2001 to
January 2003, at Institute for Infocomm Research, Singapore from January 2003 to August 2003, and at Information and Communications
University, South Korea from September 2003 to June 2004. Currently he is a PhD candidate in the ECE department at Worcester
Polytechnic Institute. His research interests include ad hoc/sensor network security, wireless mesh network security, Internet
security, and security and privacy in ubiquitous computing environments.
Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained
her Ph.D. degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc. degree
from Nanyang Technological University, Singapore, in 1998, the M.E. degree and the B.E. degree in Computer Science and Engineering
from Xi’an Jiaotong University, China, in 1996 and 1993 respectively. From December 1997 to July 1999, she worked as a Research
Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the
areas of ad hoc and sensor networks, with emphases on network and system security and routing.
Patrick J. Moran received his MSEE from Carnegie Mellon University, 1993. He is currently the CTO and Founder of AirSprite Technologies Inc,
and is driving the company to utilize advanced networking protocols for low-power wireless network systems. His interests
include architecture, protocols and high performance implementation of emerging communication technologies. Patrick has been
involved in deployment of communication and signal processing technologies since graduating from the University of Minn. in
1986. He holds several patents and publications relating to storage, medical and data processing information systems. He is
a member of the IEEE. 相似文献
6.
Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending
on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding
packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different
packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between
the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based
on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem
can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming,
then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and
convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation
results demonstrate the effectiveness of our approach.
This work was supported in part by the U.S. National Science Foundation under grant DBI-0529012, the National Science Foundation
Faculty Early Career Development Award under grant ANI-0093241 and the Office of Naval Research under Young Investigator Award
N000140210464.
Xiaoxia Huang received her BS and MS in the Electrical Engineering from Huazhong University of Science and Technology in 2000 and 2002,
respectively. She is completing her Ph.D. degree in the Department of Electrical and Computer Engineering at the University
of Florida. Her research interests include mobile computing, QoS and routing in wireless ad hoc networks and wireless sensor
networks.
Yuguang Fang received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D degree in
Electrical Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and
Computer Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical
and Computer Engineering at University of Florida in May 2000 as an assistant professor, got an early promotion to an associate
professor with tenure in August 2003 and to a full professor in August 2005. He holds a University of Florida Research Foundation
(UFRF) Professorship from 2006 to 2009. He has published over 200 papers in refereed professional journals and conferences.
He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator
Award in 2002. He has served on several editorial boards of technical journals including IEEE Transactions on Communications,
IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM Wireless Networks. He have also
been activitely participating in professional conference organizations such as serving as The Steering Committee Co-Chair
for QShine, the Technical Program Vice-Chair for IEEE INFOCOM’2005, Technical Program Symposium Co-Chair for IEEE Globecom’2004,
and a member of Technical Program Committee for IEEE INFOCOM (1998, 2000, 2003–2007). 相似文献
7.
8.
Wireless Sensor and Actor Networks (WSAN) are composed of large number of sensor nodes collaboratively observing a physical phenomenon and relatively smaller number of actor nodes, which act upon the sensed phenomenon. Due to the limited capacity of shared wireless medium and memory restrictions of the sensor nodes, channel contention and network congestion can be experienced during the operation of the network. In fact, the multi-hop nature of WSAN entangles the level of local contention and the experienced network congestion. Therefore, the unique characteristics of WSAN necessitate a comprehensive analysis of the network congestion and contention under various network conditions. In this paper, we comprehensively investigate the interactions between contention resolution and congestion control mechanisms as well as the physical layer effects in WSAN. An extensive set of simulations are performed in order to quantify the impacts of several network parameters on the overall network performance. The results of our analysis reveal that the interdependency between network parameters call for adaptive cross-layer mechanisms for efficient data delivery in WSAN. 相似文献
9.
非均匀分布下无线传感器网络节点调度机制 总被引:3,自引:0,他引:3
针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的距离信息,对节点覆盖冗余进行判别,适应于任意分布下的网络部署方式。通过实验对机制进行了性能分析和验证,结果表明该方案在保证网络覆盖的前提下,有效地延长了网络生存时间。 相似文献
10.
基于认知的无线传感器网络抗干扰路由算法 总被引:2,自引:0,他引:2
针对无线传感器网络受Wi—Fi等异构系统干扰日益严重的问题,在引入基于簇的动态多信道组网策略的基础上,综合考虑频谱受干扰程度、信道切换代价、节点剩余能量等因素,提出了一种认知频谱干扰的能量有效的路由(CSIEE)算法。仿真结果表明,该路由与EEPA,AODV,AODV—EA路由相比,有效地节约了传感器节点能量,延长了网络生命周期。 相似文献
11.
The main goal of this paper is to provide routing–table-free online algorithms for wireless sensor networks (WSNs) to select
cost (e.g., node residual energies) and delay efficient paths. As basic information to drive the routing process, both node
costs and hop count distances are considered. Particular emphasis is given to greedy routing schemes, due to their suitability
for resource constrained and highly dynamic networks. For what concerns greedy forwarding, we present the Statistically Assisted
Routing Algorithm (SARA), where forwarding decisions are driven by statistical information on the costs of the nodes within
coverage and in the second order neighborhood. By analysis, we prove that an optimal online policy exists, we derive its form
and we exploit it as the core of SARA. Besides greedy techniques, sub–optimal algorithms where node costs can be partially
propagated through the network are also presented. These techniques are based on real time learning LRTA algorithms which,
through an initial exploratory phase, converge to quasi globally optimal paths. All the proposed schemes are then compared
by simulation against globally optimal solutions, discussing the involved trade–offs and possible performance gains. The results
show that the exploitation of second order cost information in SARA substantially increases the goodness of the selected paths
with respect to fully localized greedy routing. Finally, the path quality can be further increased by LRTA schemes, whose
convergence can be considerably enhanced by properly setting real time search parameters. However, these solutions fail in
highly dynamic scenarios as they are unable to adapt the search process to time varying costs.
Michele Rossi was born in Ferrara, Italy on October 30th, 1974. He received the Laurea degree in Electrical Engineering (with honors) and
the Ph.D. degree in Information Engineering from the University of Ferrara in 2000 and 2004, respectively. Since 2000 he has
been a Research Fellow at the Department of Engineering of the University of Ferrara. During 2003 he was on leave at the Center
for Wireless Communications (CWC) at the University of California San Diego (UCSD), where he did research on wireless sensor
networks. In November 2005 he joined the Department of Information Engineering of the University of Padova, Italy, where he
is currently an Assistant Professor. Michele Rossi is currently part of the EU funded Ambient Networks and eSENSE projects.
His research interests include: TCP/IP protocols over wireless networks, performance analysis of link layer retransmission
techniques, routing and access selection in heterogeneous wireless networks and MAC/routing algorithms for wireless sensor
networks.
Michele Zorzi was born in Venice, Italy, in 1966. He received the Laurea degree and the Ph.D. degree in Electrical Engineering from the
University of Padova, Italy, in 1990 and 1994, respectively. During the Academic Year 1992/93, he was on leave at the University
of California, San Diego (UCSD), attending graduate courses and doing research on multiple access in mobile radio networks.
In 1993, he joined the faculty of the Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy. After spending
three years with the Center for Wireless Communications at UCSD, in 1998 he joined the School of Engineering of the University
of Ferrara, Italy, and in 2003 joined the Department of Information Engineering of the University of Padova, Italy, where
he is currently a Professor. His present research interests include performance evaluation in mobile communications systems,
random access in mobile radio networks, ad hoc and sensor networks, and energy constrained communications protocols. Dr. Zorzi
from 2003 to 2005 was the Editor-In-Chief of the IEEE Wireless Communications Magazine, and currently serves on the Editorial Boards of the IEEE Transactions on Communications, the IEEE Transactions on Wireless Communications, the IEEE Transactions on Mobile Computing, the Wiley Journal of Wireless Communications and Mobile Computing and the ACM/URSI/Kluwer Journal of Wireless Networks. He was also guest editor for special issues in the IEEE Personal Communications Magazine (Energy Management in Personal Communications Systems) and the IEEE Journal on Selected Areas in Communications (Multi-media Network Radios).
Ramesh R. Rao was born in Sindri, India, where he completed his undergraduate work at the Regional Engineering College of the University
of Madras in Tiruchirapalli, obtaining a BE (Honors) degree in Electronics and Communications in 1980. He completed his graduate
work at the University of Maryland, College Park, Maryland where he received his M.S. and Ph.D. Professor Rao is currently
a Professor at the University of California, San Diego (UCSD) at the department of Electrical and Computer Engineering in
the Irwin and Joan Jacobs School of Engineering, where he has been a member of the faculty since 1984. Professor Rao is the
former director of UCSD’s Center for Wireless Communications (CWC), and currently serves as the Qualcomm Endowed Chair in
Telecommunications and Information Technologies, and as the Director of the San Diego Division of the California Institute
of Telecommunications and Information Technology [Cal-(IT)2]. As Director of the San Diego Division of Cal-(IT)2, he leads several interdisciplinary and collaborative projects. His research interests include architectures, protocols and
performance analysis of computer and communication networks, and he has published extensively on these topics. Since 1984,
Professor Rao has authored over 100 technical papers, contributed book chapters, conducted a number of short courses and delivered
invited talks and plenary lectures. He is currently supervising both masters and doctoral students. 相似文献
12.
Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms
usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically
to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider
the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the
base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster,
leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal
Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base
station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster
data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which
considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show
that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime.
Guihai Chen obtained his B.S. degree from Nanjing University, M. Engineering from Southeast University, and PhD from University of Hong
Kong. He visited Kyushu Institute of Technology, Japan in 1998 as a research fellow, and University of Queensland, Australia
in 2000 as a visiting professor. During September 2001 to August 2003, he was a visiting professor at Wayne State University.
He is now a full professor and deputy chair of Department of Computer Science, Nanjing University. Prof. Chen has published
more than 100 papers in peer-reviewed journals and refereed conference proceedings in the areas of wireless sensor networks,
high-performance computer architecture, peer-to-peer computing and performance evaluation. He has also served on technical
program committees of numerous international conferences. He is a member of the IEEE Computer Society.
Chengfa Li was born 1981 and obtained his Bachelor’s Degree in mathematics in 2003 and his Masters Degree in computer science in 2006,
both from Nanjing University, China. He is now a system programmer at Lucent Technologies Nanjing Telecommunication Corporation.
His research interests include wireless ad hoc and sensor networks.
Mao Ye was born in 1981 and obtained his Bachelor’s Degree in computer science from Nanjing University, China, in 2004. He served
as a research assistant At City University of Hong Kong from September 2005 to August 2006. He is now a PhD candidate with
research interests in wireless networks, mobile computing, and distributed systems.
Jie Wu is a professor in the Department of Computer Science and Engineering at Florida Atlantic University. He has published more
than 300 papers in various journal and conference proceedings. His research interests are in the areas of mobile computing,
routing protocols, fault-tolerant computing, and interconnection networks. Dr. Wu serves as an associate editor for the IEEE
Transactions on Parallel and Distributed Systems and several other international journals. He served as an IEEE Computer Society
Distinguished Visitor and is currently the chair of the IEEE Technical Committee on Distributed Processing (TCDP). He is a
member of the ACM, a senior member of the IEEE, and a member of the IEEE Computer Society. 相似文献
13.
Weidong Fang Wuxiong Zhang Wei Yang Zhannan Li Weiwei Gao Yinxuan Yang 《Digital Communications & Networks》2021,7(4):470-478
The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network (WSN). Although the hierarchical routing protocol can effectively cope with large-scale application scenarios, how to elect a secure cluster head and balance the network load becomes an enormous challenge. In this paper, a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol (LEACH-TM) is proposed. In LEACH-TM, by using the number of dynamic decision cluster head nodes, residual energy and density of neighbor nodes, the size of the cluster can be better constrained to improve energy efficiency, and avoid excessive energy consumption of a node. Simultaneously, the trust management scheme is introduced into LEACH-TM to defend against internal attacks. The simulation results show that, compared with LEACH-SWDN protocol and LEACH protocol, LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption, and can effectively mitigate the influence of malicious nodes on cluster head selection, which can greatly guarantee the security of the overall network. 相似文献
14.
无线传感器网络通常使用低占空比的异步睡眠调度来降低节点能耗。由于发送节点在接收节点醒来后才能向其发送数据,这将引入额外的等待时延。在最近的一些任播路由机制中,发送节点动态地选择最先醒来的候选节点转发数据,以最小化等待时延。但是,由于从最先醒来的候选节点到基站的时延可能并不低,任播路由机制并不一定能最小化端到端总时延。为此,提出了一种适用于异步无线传感器网络的机会路由机制,将路由决策建模为强马尔科夫过程,并根据最优停止理论推导出该过程一种简化的停止规则。仿真结果表明,节点到基站的最大端到端时延仅为基于地理位置的机会路由的68.5%。 相似文献
15.
无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。 相似文献
16.
17.
Mingyuan Yan Jing He Shouling Ji Yingshu Li 《Wireless Communications and Mobile Computing》2014,14(9):849-864
Query scheduling as one of the most important technologies used in query processing has been widely studied recently. In this paper, we investigate the Minimum Latency Multi‐Regional Query Scheduling (ML‐MRQS) problem in wireless Sensor Networks (WSNs), which aims to generate a scheduling plan with minimum latency under a more practical query model called Multi‐Regional Query (MRQ). An MRQ targets at interested data from multiple regions of a WSN, where each region is a subarea. Because the ML‐MRQS problem is NP‐hard, we propose a heuristic scheduling algorithm Multi‐Regional Query Scheduling Algorithm (MRQSA) to solve this problem. Theoretical analysis shows that the latency of MRQSA is upper bounded by 23A + B + C for an MRQ with m query regions , where is the maximum latency for non‐overlapped regions, is the maximum latency for overlapped regions, and is the accumulated latency for data transmission from the accessing nodes to the sink. Simulation results show that MRQSA reduces latency by 42.7% to 51.63% with respect to different number of query regions, network density, region size, and interference/transmission range compared with C‐DCQS, while guaranteeing energy efficiency. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
18.
Haojun Huang Guangmin Hu Fucai Yu 《International Journal of Communication Systems》2013,26(1):100-113
Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
19.
Michael Chien‐Chun Hung Kate Ching‐Ju Lin Cheng‐Fu Chou Chih‐Cheng Hsu 《Wireless Communications and Mobile Computing》2013,13(8):760-773
The utilization of limited energy in wireless sensor networks (WSNs) is the critical concern, whereas the effectiveness of routing mechanisms substantially influence energy usage. We notice that two common issues in existing specific routing schemes for WSNs are that (i) a path may traverse through a specific set of sensors, draining out their energy quickly and (ii) packet retransmissions over unreliable links may consume energy significantly. In this paper, we develop an energy‐efficient routing scheme (called EFFORT) to maximize the amount of data gathered in WSNs before the end of network lifetime. By exploiting two natural advantages of opportunistic routing, that is, the path diversity and the improvement of transmission reliability, we propose a new metric that enables each sensor to determine a suitable set of forwarders as well as their relay priorities. We then present EFFORT, a routing protocol that utilizes energy efficiently and prolongs network lifetime based on the proposed routing metric. Simulation results show that EFFORT significantly outperforms other routing protocols. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
20.
H. C. Leligou P. Trakadas S. Maniatis P. Karkazis T. Zahariadis 《Wireless Communications and Mobile Computing》2012,12(12):1091-1103
As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against routing attacks. Once trust information is available for all network nodes, the routing decisions can take it into account, i.e. routing can be based on both location and trust attributes. In this paper, we investigate different ways to incorporate trust in location‐based routing schemes and we propose a novel way of balancing trust and location information. Computer simulations show that the proposed routing rule exhibits excellent performance in terms of delivery ratio, latency time and path optimality. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献