共查询到20条相似文献,搜索用时 15 毫秒
1.
Long Cheng Canfeng Chen Jian Ma Lei Shu 《International Journal of Communication Systems》2012,25(12):1585-1602
In asynchronous duty‐cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contention‐based forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention‐based geographic forwarding (CGF) for two asynchronous duty‐cycling (ADC) models, which we refer to as uninterruptible ADC (U‐ADC) and interruptible ADC (I‐ADC). We propose a new residual time‐aware routing metric for CGF in the I‐ADC model and present a residual time‐aware forwarding scheme using this metric. We evaluate the performance of CGF in both asynchronous duty‐cycling models. Simulation results show that CGF in the U‐ADC model provides a shorter delivery delay while suffering from a high sender effective duty cycle problem. CGF in the I‐ADC model incurs a very long data delivery delay, but it can achieve a good load balancing among nodes. It is also demonstrated that the proposed residual time‐aware forwarding scheme lowers the effects of the performance degradation caused by the pure asynchronous duty‐cycling operation. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
2.
Broadcast is an essential operation in wireless sensor networks. Because of the necessity of energy conservation, minimizing the number of transmissions is always a challenging issue in broadcasting scheme design. This paper studies the minimum‐transmission broadcast problem in duty‐cycled wireless sensor networks where each sensor operates under active/dormant cycles. To address the problem, our proposed scheme, Broadcast Redundancy Minimization Scheduling (BRMS), finds a set of forwarding nodes, which minimizes the number of broadcast transmissions. Then, it constructs a forest of sub‐trees based on the relationship between each forwarding node and its corresponding receivers. A broadcast tree is constructed ultimately by connecting all sub‐trees with a minimum number of connectors. Theoretical analysis shows that BRMS obtains a lower approximation ratio as well as time complexity compared with existing schemes. A set of extensive simulations is conducted to evaluate the performance of BRMS. The results reveal that BRMS outperforms others and its solution is close to the lower bound of the problem in terms of the total number of transmissions. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
3.
4.
Noureddine Moussa Abdelbaki El Belrhiti El Alaoui 《International Journal of Communication Systems》2019,32(16)
Energy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics. 相似文献
5.
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. 相似文献
6.
7.
Hamed Alasarpanahi Vahid Ayatollahitafti Abolfazl Gandomi 《International Journal of Communication Systems》2020,33(6)
Underwater wireless sensor networks (UWSNs) consist of a group of sensors that send the information to the sonobuoys at the surface level. Void area, however, is one of the challenges faced by UWSNs. When a sensor falls in a void area of communication, it causes problems such as high latency, power consumption, or packet loss. In this paper, an energy‐efficient void avoidance geographic routing protocol (EVAGR) has been proposed to handle the void area with low amount of energy consumption. In this protocol, a suitable set of forwarding nodes is selected using a weight function, and the data packets are forwarded to the nodes inside the set. The weight function includes the consumed energy and the depth of the candidate neighboring nodes, and candidate neighboring node selection is based on the packet advancement of the neighboring nodes toward the sonobuoys. Extensive simulation experiments were performed to evaluate the efficiency of the proposed protocol. Simulation results revealed that the proposed protocol can effectively achieve better performance in terms of energy consumption, packet drop, and routing overhead compared with the similar routing protocol. 相似文献
8.
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 相似文献
9.
Mohammad Hossein Adhami Reza Ghazizade Mohammad‐Hassan Majidi 《International Journal of Communication Systems》2020,33(8)
The problem of tracking multiple mobile targets, using a wireless sensor network, is investigated in this paper. We propose a new sensor grouping algorithm, based on the maximum sensor separation distances (G‐MSSD), for estimating the location of multiple indistinguishable targets, either jointly or individually, depending on the distances between the generated groups. The joint tracking algorithm is formulated as a maximum likelihood (ML) estimator and solved through a modified version of the well‐known Gauss‐Newton (MGN) iterative method. We propose two candidate initial guesses for MGN based on G‐MSSD in joint tracking mode, while for the individual mode, the information of each group is used to estimate the location of only the corresponding target. The Cramer‐Rao lower bound (CRLB) for the variance of the proposed ML estimator is derived, and the potential conditions for reducing the CRLB are presented. Since tracking efficiency is affected by poor estimates, we present two criteria to evaluate the quality of estimates and detect the poor ones. An approach is also proposed for correcting the poor estimates, based on additional initial guesses. We demonstrate the effectiveness and accuracy of our proposed dual‐mode algorithm via simulation results and compare our results with the Multi‐Resolution search algorithm. 相似文献
10.
11.
Lei Shi Baoxian Zhang Hussein T. Mouftah Jian Ma 《International Journal of Communication Systems》2013,26(10):1341-1355
Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
12.
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. 相似文献
13.
14.
15.
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. 相似文献
16.
无线传感器网络通常使用低占空比的异步睡眠调度来降低节点能耗。由于发送节点在接收节点醒来后才能向其发送数据,这将引入额外的等待时延。在最近的一些任播路由机制中,发送节点动态地选择最先醒来的候选节点转发数据,以最小化等待时延。但是,由于从最先醒来的候选节点到基站的时延可能并不低,任播路由机制并不一定能最小化端到端总时延。为此,提出了一种适用于异步无线传感器网络的机会路由机制,将路由决策建模为强马尔科夫过程,并根据最优停止理论推导出该过程一种简化的停止规则。仿真结果表明,节点到基站的最大端到端时延仅为基于地理位置的机会路由的68.5%。 相似文献
17.
Lei Shi Zheng Yao Baoxian Zhang Cheng Li Jian Ma 《International Journal of Communication Systems》2015,28(11):1789-1804
Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
18.
A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol. 相似文献
19.
20.
为了延长采用电池供电的无线传感器网络的生命周期,提出了一种综合考虑单个节点能耗和节点传输信息至汇集节点所需总能耗的路由算法.该算法首先根据网络中节点到汇集节点从小到大的距离顺序选择待规划节点,然后计算各对应候选节点的评价参数,该参数由单节点能耗和节点传输信息至汇集节点所需总能耗加权得到,最后选择评价参数最小的候选节点作为待规划节点的中继节点.仿真结果表明,该算法的生命周期明显长于LEACH(Low Energy Adaptive Clustering Hier-archy)算法. 相似文献