共查询到20条相似文献,搜索用时 15 毫秒
1.
Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks (WSN), the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing 相似文献
2.
Event monitoring is a common application in wireless sensor networks. For event monitoring, a number of sensor nodes are deployed to monitor certain phenomenon. When an event is detected, the sensor nodes report it to a base station (BS), where a network operator can take appropriate action based on the event report. In this paper, we are interested in scenarios where the event must be reported within a time bound to the BS possibly over multiple hops. However, such event reports can be hampered by compromised nodes in the middle that drop, modify, or delay the event report.To defend against such an attack, we propose Sem, a Secure Event Monitoring protocol against arbitrary malicious attacks by Byzantine adversary nodes. Sem provides the following provable security guarantees. As long as the compromised nodes want to stay undetected, a legitimate sensor node can report an event to the BS within a bounded time. If the compromised nodes prevent the event from being reported to the BS within the bounded time, the BS can identify a pair of nodes that is guaranteSchool of Electrical and Computer Engineeringed to contain at least one compromised node. To the best of our knowledge, no prior work in the literature can provide such guarantees.Sem is designed to use the minimum level of asymmetric cryptography during normal operation when there is no attack, and use cryptographic primitives more liberally when an attack is detected. This design has the advantage that the overall Sem protocol is lightweight in terms of the computational resources and the network traffic required by the cryptographic operations. We also show an operational example of Sem using TOSSIM simulations. 相似文献
3.
针对分簇的水声传感网,提出了一种基于时分多址(TDMA)的MAC层协议——Cluster-TDMA。该协议主要由规划阶段和传输阶段组成。规划阶段,首先由网关节点规划能造成簇间干扰的子节点的传输,其次由各簇头节点分别规划本簇内其他子节点的传输;传输阶段,子节点根据规划表周期性地向簇头节点发送数据,这些数据最终汇聚到网关节点。该协议简单有效地解决了引起簇间干扰子结点的传输规划问题。C++仿真实验表明,该协议具有良好的吞吐率和能量效率性能。 相似文献
4.
Clustering provides an effective way to prolong the lifetime of wireless sensor networks.One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network.Another is the mode of inter-cluster communication.In this paper,an energy-balanced unequal clustering(EBUC)protocol is proposed and evaluated.By using the particle swarm optimization(PSO)algorithm,EBUC partitions all nodes into clusters of unequal size,in which the clusters closer to the base station have smaller size.The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the 'hot-spots' problem can be avoided.For inter-cluster communication,EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads.Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime. 相似文献
5.
Sungkyu Cho Hyojeong Shin Seungjae Han Hojung Cha Rhan Ha 《Wireless Communications and Mobile Computing》2010,10(6):857-874
Network reprogramming is a process used to update program codes of sensor nodes that are already deployed. To deal with potentially unstable link conditions of wireless sensor networks, the epidemic approach based on 3‐way advertise‐request‐data handshaking is preferred for network reprogramming. Existing epidemic protocols, however, require a long completion period and high traffic overhead in high‐density networks, mainly due to the hidden terminal problem. In this paper, we address this problem by dynamically adjusting the frequency of advertisement messages in terms of the density of sensor nodes, which is the number of sensor nodes in a certain area. We compare the performance of the proposed scheme, called DANP (Density‐Adaptive Network Reprogramming Protocol), with a well‐known epidemic protocol, Deluge. Simulations indicate that, in the grid topologies, DANP outperforms Deluge by about 30% in terms of the completion time and about 50% in terms of the traffic overhead. Significant performance gain is observed in random topologies as well. The performance of DANP is further confirmed via measurements in an experimental test bed. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
6.
Clock synchronization for wireless sensor networks: a survey 总被引:10,自引:0,他引:10
Recent advances in micro-electromechanical (MEMS) technology have led to the development of small, low-cost, and low-power sensors. Wireless sensor networks (WSNs) are large-scale networks of such sensors, dedicated to observing and monitoring various aspects of the physical world. In such networks, data from each sensor is agglomerated using data fusion to form a single meaningful result, which makes time synchronization between sensors highly desirable. This paper surveys and evaluates existing clock synchronization protocols based on a palette of factors like precision, accuracy, cost, and complexity. The design considerations presented here can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor-network application. Finally, the survey provides a valuable framework by which designers can compare new and existing synchronization protocols. 相似文献
7.
8.
The features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy. 相似文献
9.
10.
《Digital Communications & Networks》2021,7(3):385-398
To design an energy-efficient Medium Access Control (MAC) protocol for the Underwater Wireless Sensor Networks (UWSNs) is an urgent research issue since depleted batteries cannot be recharged or replaced in the underwater environment. Moreover, the underwater acoustic channels are affected by hindrances such as long propagation delay and limited bandwidth, which appear in the design of the MAC protocol for the UWSNs. The available MAC protocols for the terrestrial wireless sensor networks exhibit low performance in energy efficiency, throughput and reliability in the UWSNs, and cannot be used in the UWSNs directly because of their unique characteristics. This paper proposes a synchronous duty-cycled reservation-based MAC protocol named Ordered Contention MAC (OCMAC) protocol. The basic mechanism of this protocol is to schedule data transmission by transmitters through the scheduling of Ready To Send (RTS) frames. The protocol eliminates the possible collision during data transmission and improves communication efficiency. The paper analyzes the performance in energy efficiency, throughput and reliability of the protocol by modeling the queuing behavior of OCMAC with a Markov Chain process. Furthermore, the analytical model is validated through a simulation study. The analysis results demonstrated that while providing good throughput and reliability, OCMAC can achieve energy saving. 相似文献
11.
Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks 下载免费PDF全文
Suleiman Zubair Norsheila Fisal Mohammed B. Abazeed Bala Alhaji Salihu Adnan Shahid Khan 《International Journal of Communication Systems》2015,28(1):1-18
Recent literature characterizes future wireless sensor networks (WSN) with dynamic spectrum capabilities. When cognitive radio is introduced as a main component of a network, a network management protocol is needed to ensure network connectivity and stability especially in highly dynamic environments. Implementing such protocols in WSN opens more challenges because of the resource constraints in sensor networks. We propose a distributed lightweight solution that fulfills this need for WSN. With this protocol, a node in a multichannel environment is quickly able to establish a control channel with neighboring nodes. Lightweight distributed geographical either increases or reduces the coverage area of the control channel based on perceived interference and adequately takes care of intersecting nodes with minimal overhead. By identifying local minima nodes, it also has the potentiality of reducing route failure by 70% further reducing the time and energy overhead incurred by switching to angle routing or maximum power transmission schemes usually used to solve the local minima issue. The work shows best operating values in terms of duty cycle and signal to noise ratio threshold frequencies and the lightweight nature of lightweight distributed geographical in terms of energy and communication overhead, which suits network management protocols for cognitive radio sensor networks. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
12.
针对于无线传感器网络的发展,以及新型的协议规范ZigBee协议在无线传感器网络中广泛应用,以分析研究基于ZigBee协议的无线传感器网络的服务质量的评价机制为目的。通过对无线传感器网络及ZigBee协议的组成、通信特点的研究,以及结合传统网络的QoS评价机制,最终总结得到可以从5个方面来评价ZigBee协议的无线传感器网络的服务质量。 相似文献
13.
Reliable and high throughput data delivery in cognitive radio networks remains an open challenge owing to the inability of the source to quickly identify and react to changes in spectrum availability. The window-based rate adaptation in TCP relies on acknowledgments (ACKs) to self trigger the sending rate, which are often delayed or lost owing to intermittent primary user (PU) activity, resulting in an incorrect inference of congestion by the source node. This paper proposes the first equation-based transport protocol based on TCP Friendly Rate Control for Cognitive Radio, called as TFRC-CR, which allows immediate changes in the transmission rate based on the spectrum-related changes in the network environment. TFRC-CR has the following unique features: (i) it leverages the recent FCC mandated spectrum databases with minimum querying overhead, (ii) it enables fine adjustment of the transmission rate by identifying the instances of true network congestion, as well as (iii) provides guidelines on when to re-start the source transmission after a pause due to PU activity. TFRC-CR is evaluated through an extensive set of module additions to the ns-2 simulator which is also released for further investigation by the research community. 相似文献
14.
15.
Christopher Ward Cheong H. Choi Thomas F. Hain 《International Journal of Satellite Communications and Networking》1994,12(6):507-524
LAMS-DLC, a data link control protocol for low altitude satellite networks, was developed to overcome throughput limitations inherent in event-based positive acknowledgment (POS-ACK) automatic repeat request (ARQ) class protocols by relaxing certain reliability constraints, in particular the in-sequence delivery constraint. This relaxation results in a new class of link layer service, that of reliable datagram, and permits a fresh approach to link layer protocol design. In this paper we discuss the motivation for such a protocol, describe one such protocol, LAMS-DLC, and compare throughput efficiency with results obtained from a simulation model. Results suggest that LAMS-DLC provides near optimal throughput efficiencies in the target environment, while using significantly less buffer space than is required for conventional POS-ACK protocols. 相似文献
16.
Lana I. S. Hamad Tamer Dag Tansal Gucluoglu 《International Journal of Communication Systems》2023,36(2):e5379
Internet of things (IoT) applications based on wireless sensor networks (WSNs) have recently gained vast momentum. These applications vary from health care, smart cities, and military applications to environmental monitoring and disaster prevention. As a result, energy consumption and network lifetime have become the most critical research area of WSNs. Through energy-efficient routing protocols, it is possible to reduce energy consumption and extend the network lifetime for WSNs. Using hybrid routing protocols that incorporate multiple transmission methods is an effective way to improve network performance. This paper proposes modulated R-SEP (MR-SEP) for large-scale WSN-based IoT applications. MR-SEP is based on the well-known stable election protocol (SEP). MR-SEP defines three initial energy levels for the nodes to improve the network energy distribution and establishes multi-hop communication between the cluster heads (CHs) and the base station (BS) through relay nodes (RNs) to reduce the energy consumption of the nodes to reach the BS. In addition, MR-SEP reduces the replacement frequency of CHs, which helps increase network lifetime and decrease power consumption. Simulation results show that MR-SEP outperforms SEP, LEACH, and DEEC protocols by 70.2%, 71.58%, and 74.3%, respectively, in terms of lifetime and by 86.53%, 86.68%, and 86.93% in terms of throughput. 相似文献
17.
A fundamental issue in the design of a wireless sensor network is to devise mechanisms to make efficient use of its energy, and thus, extend its lifetime. The information about the amount of available energy in each part of the network is called the energy map and can be useful to increase the lifetime of the network. In this paper, we address the problem of constructing the energy map of a wireless sensor network using prediction-based approach. Simulation results compare the performance of a prediction-based approach with a naive one in which no prediction is used. Results show that the prediction-based approach outperforms the naive in a variety of parameters. We also investigate the possibility of sampling the energy information in some nodes in the network in order to diminish the number of energy information packets. Results show that the use of sampling techniques produce more constant error curves. 相似文献
18.
Abdul Wahid Sungwon Lee Dongkyun Kim 《International Journal of Communication Systems》2014,27(10):2048-2062
Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP2R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP2R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP2R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP2R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
19.
Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA. 相似文献