The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs...The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).展开更多
In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the c...In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.展开更多
Wireless sensor networks are provided with a limited source of power. The lifetime of such networks is an overwhelming matter in most network applications. This lifetime depends strongly on how efficiently such energy...Wireless sensor networks are provided with a limited source of power. The lifetime of such networks is an overwhelming matter in most network applications. This lifetime depends strongly on how efficiently such energy is distributed over the nodes especially during transmitting and receiving data. Each node may route messages to destination nodes either through short hops or long hops. Optimizing the length of these hops may save energy, and therefore extend the lifetime of WSNs. In this paper, we propose a theorem to optimize the hop’s length so to make WSN power consumption minimal. The theorem establishes a simple condition on hop’s length range. Computer simulation when performing such condition on Mica2 sensors and Mica2dot sensors reveals good performance regarding WSNs energy consumption.展开更多
Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network ...Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network lifetime by optimizing therouting strategy. First, a network model is established, an operatingcontrol strategy is devised, and energy consumption characteristicsare analyzed. Second, a fast route-planning algorithm isproposed to obtain the original path that takes into account the remainingenergy of communicating nodes and the amount of energyconsumed in data transmission. Next, considering the amount ofenergy consumed by an individual node and the entire network,a criterion function is established to describe node performanceand to evaluate data transmission ability. Finally, a route optimizingalgorithm is proposed to increase network lifetime by adjusting thetransmission route in protection of the weak node （the node withlow transmission ability）. Simulation and comparison experimentalresults demonstrate the good performance of the proposed algorithmsto increase network lifetime.展开更多
Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks ...Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.展开更多
This paper proposes an environment-aware best- retransmission count selected optimization control scheme over IEEE 802.11 multi-hop wireless networks. The proposed scheme predicts the wireless resources by using stati...This paper proposes an environment-aware best- retransmission count selected optimization control scheme over IEEE 802.11 multi-hop wireless networks. The proposed scheme predicts the wireless resources by using statistical channel state and provides maximum retransmission count optimization based on wireless channel environment state to improve the packet delivery success ratio. The media access control （MAC） layer selects the best-retransmission count by perceiving the types of packet loss in wireless link and using the wireless channel charac- teristics and environment information, and adjusts the packet for- warding adaptively aiming at improving the packet retransmission probability. Simulation results show that the best-retransmission count selected scheme achieves a higher packet successful delivery percentage and a lower packet collision probability than the corresponding traditional MAC transmission control protocols.展开更多
In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation...In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation, which increases the possibility of hotspots in areas where the density of nodes is very less. If the node density is very high, cluster-heads may expend high energy leading to their early death. Existing cluster protocols that concentrate on energy conservation have not exhibited their impact on packet delivery and delay. In this proposed protocol, clusters are constructed based on the range of nodes, distance between neighbouring nodes and density of nodes over a region resulting in the formation of dissimilar clusters. With this method, the entire sensing region is considered to be a large circular region with base station positioned at the centre. Initially, the nodes that can be able to reach base station in a single hop are considered for constructing inner smaller circular regions over the entire region. This method is iterated for n-hop nodes until n-concentric circular regions are formed. These circular boundaries are reconstructed based on a distance metric, density of nodes and a divergence factor. Using this architecture, network analysis is done by routing data to the base station from different sized clusters. Based on simulation results, this new protocol Dynamic Unequal Clustered Routing (D-UCR), despite being energy efficient, showed better data delivery ratio and minimized delay when compared with other traditional clustering algorithms such as Leach and Equal Clustered Routing.展开更多
Routing protocols in Mobile Ad Hoc Networks(MANETs)operate with Expanding Ring Search(ERS)mechanism to avoid ooding in the network while tracing step.ERS mechanism searches the network with discerning Time to Live(TTL...Routing protocols in Mobile Ad Hoc Networks(MANETs)operate with Expanding Ring Search(ERS)mechanism to avoid ooding in the network while tracing step.ERS mechanism searches the network with discerning Time to Live(TTL)values described by respective routing protocol that save both energy and time.This work exploits the relation between the TTL value of a packet,trafc on a node and ERS mechanism for routing in MANETs and achieves an Adaptive ERS based Per Hop Behavior(AERSPHB)rendition of requests handling.Each search request is classied based on ERS attributes and then processed for routing while monitoring the node trafc.Two algorithms are designed and examined for performance under exhaustive parametric setup and employed on adaptive premises to enhance the performance of the network.The network is tested under congestion scenario that is based on buffer utilization at node level and link utilization via back-off stage of Carrier Sense Multiple Access with Collision Avoidance(CSMA/CA).Both the link and node level congestion is handled through retransmission and rerouting the packets based on ERS parameters.The aim is to drop the packets that are exhausting the network energy whereas forward the packets nearer to the destination with priority.Extensive simulations are carried out for network scalability,node speed and network terrain size.Our results show that the proposed models attain evident performance enhancement.展开更多
针对铁路重载货运列车在复杂运行环境下的智能组网技术难题,通过对比分析远距离无线电(Long Range Radio,LoRa)、ZigBee及Wi-Fi等多种无线通信技术,构建基于LoRa技术的多跳级联组网架构。设计车辆网与列车网分层组网方案,以大秦线20 00...针对铁路重载货运列车在复杂运行环境下的智能组网技术难题,通过对比分析远距离无线电(Long Range Radio,LoRa)、ZigBee及Wi-Fi等多种无线通信技术,构建基于LoRa技术的多跳级联组网架构。设计车辆网与列车网分层组网方案,以大秦线20 000 t重载货运列车及使用场景为研究对象,通过静态距离测试、高速动态测试及山体屏蔽测试,验证LoRa技术的通信性能。实验结果表明,静态条件下可实现3 km稳定通信,动态条件下通信距离缩短至1 km,山体遮挡对信号传输影响显著。研究为铁路重载货运列车智能组网技术的工程应用提供了理论依据和实践基础。展开更多
Most of the existing routing protocols for heterogeneous multi-hop wireless networks （HWMNs） use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of netw...Most of the existing routing protocols for heterogeneous multi-hop wireless networks （HWMNs） use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes＇ location information （TSRAL） is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.展开更多
Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the mul...Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.展开更多
文摘The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).
文摘In Wireless Sensor Networks (WSN), the lifetime of sensors is the crucial issue. Numerous schemes are proposed to augment the life time of sensors based on the wide range of parameters. In majority of the cases, the center of attraction will be the nodes’ lifetime enhancement and routing. In the scenario of cluster based WSN, multi-hop mode of communication reduces the communication cast by increasing average delay and also increases the routing overhead. In this proposed scheme, two ideas are introduced to overcome the delay and routing overhead. To achieve the higher degree in the lifetime of the nodes, the residual energy (remaining energy) of the nodes for multi-hop node choice is taken into consideration first. Then the modification in the routing protocol is evolved (Multi-Hop Dynamic Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in frequent interval based on nodes residual energy to avoid the data loss due to path extrication and also to avoid the early dying of nodes due to elevation of data forwarding. The proposed method improves network’s lifetime significantly. The diminution in the average delay and increment in the lifetime of network are also accomplished. The MHDP offers 50% delay lesser than clustering. The average residual energy is 20% higher than clustering and 10% higher than multi-hop clustering. The proposed method improves network lifetime by 40% than clustering and 30% than multi-hop clustering which is considerably much better than the preceding methods.
文摘Wireless sensor networks are provided with a limited source of power. The lifetime of such networks is an overwhelming matter in most network applications. This lifetime depends strongly on how efficiently such energy is distributed over the nodes especially during transmitting and receiving data. Each node may route messages to destination nodes either through short hops or long hops. Optimizing the length of these hops may save energy, and therefore extend the lifetime of WSNs. In this paper, we propose a theorem to optimize the hop’s length so to make WSN power consumption minimal. The theorem establishes a simple condition on hop’s length range. Computer simulation when performing such condition on Mica2 sensors and Mica2dot sensors reveals good performance regarding WSNs energy consumption.
基金supported by the National Natural Science Foundation of China(61571068)the Innovative Research Projects of Colleges and Universities in Chongqing(12A19369)
文摘Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network lifetime by optimizing therouting strategy. First, a network model is established, an operatingcontrol strategy is devised, and energy consumption characteristicsare analyzed. Second, a fast route-planning algorithm isproposed to obtain the original path that takes into account the remainingenergy of communicating nodes and the amount of energyconsumed in data transmission. Next, considering the amount ofenergy consumed by an individual node and the entire network,a criterion function is established to describe node performanceand to evaluate data transmission ability. Finally, a route optimizingalgorithm is proposed to increase network lifetime by adjusting thetransmission route in protection of the weak node （the node withlow transmission ability）. Simulation and comparison experimentalresults demonstrate the good performance of the proposed algorithmsto increase network lifetime.
基金Project supported by the Science Fund for Creative Research Groups of the National Natural Science Foundation of China （Grant No. 60921063） and the National High Technology Research and Development Program of China （Grant No. 2013AA013601）.
文摘Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.
基金supported by National Natural Science Foundation of China(61304256)Zhejiang Provincial Natural Science Foundation of China(LQ13F030013)+4 种基金Project of the Education Department of Zhejiang Province(Y201327006)Young Researchers Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering and Zhejiang Sci-Tech University Key Laboratory(ZSTUME01B15)New Century 151 Talent Project of Zhejiang Province521 Talent Project of Zhejiang Sci-Tech UniversityYoung and Middle-aged Talents Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering
基金supported by the National Basic Research Program of China(2013CB329005)the National Natural Science Foundation of China(61101105+9 种基金6120116261302100)the Basic Research Program of Jiangsu Province(BK2011027BK2012434)the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province(12KJB51002212KJB510020)the Postdoctoral Science Foundation of China(2013M531391)the State Grid Project(52090F135015)the Scientific Research Foundation for Nanjing University of Posts and Telecommunications(NY211006NY211007)
文摘This paper proposes an environment-aware best- retransmission count selected optimization control scheme over IEEE 802.11 multi-hop wireless networks. The proposed scheme predicts the wireless resources by using statistical channel state and provides maximum retransmission count optimization based on wireless channel environment state to improve the packet delivery success ratio. The media access control （MAC） layer selects the best-retransmission count by perceiving the types of packet loss in wireless link and using the wireless channel charac- teristics and environment information, and adjusts the packet for- warding adaptively aiming at improving the packet retransmission probability. Simulation results show that the best-retransmission count selected scheme achieves a higher packet successful delivery percentage and a lower packet collision probability than the corresponding traditional MAC transmission control protocols.
文摘In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation, which increases the possibility of hotspots in areas where the density of nodes is very less. If the node density is very high, cluster-heads may expend high energy leading to their early death. Existing cluster protocols that concentrate on energy conservation have not exhibited their impact on packet delivery and delay. In this proposed protocol, clusters are constructed based on the range of nodes, distance between neighbouring nodes and density of nodes over a region resulting in the formation of dissimilar clusters. With this method, the entire sensing region is considered to be a large circular region with base station positioned at the centre. Initially, the nodes that can be able to reach base station in a single hop are considered for constructing inner smaller circular regions over the entire region. This method is iterated for n-hop nodes until n-concentric circular regions are formed. These circular boundaries are reconstructed based on a distance metric, density of nodes and a divergence factor. Using this architecture, network analysis is done by routing data to the base station from different sized clusters. Based on simulation results, this new protocol Dynamic Unequal Clustered Routing (D-UCR), despite being energy efficient, showed better data delivery ratio and minimized delay when compared with other traditional clustering algorithms such as Leach and Equal Clustered Routing.
文摘Routing protocols in Mobile Ad Hoc Networks(MANETs)operate with Expanding Ring Search(ERS)mechanism to avoid ooding in the network while tracing step.ERS mechanism searches the network with discerning Time to Live(TTL)values described by respective routing protocol that save both energy and time.This work exploits the relation between the TTL value of a packet,trafc on a node and ERS mechanism for routing in MANETs and achieves an Adaptive ERS based Per Hop Behavior(AERSPHB)rendition of requests handling.Each search request is classied based on ERS attributes and then processed for routing while monitoring the node trafc.Two algorithms are designed and examined for performance under exhaustive parametric setup and employed on adaptive premises to enhance the performance of the network.The network is tested under congestion scenario that is based on buffer utilization at node level and link utilization via back-off stage of Carrier Sense Multiple Access with Collision Avoidance(CSMA/CA).Both the link and node level congestion is handled through retransmission and rerouting the packets based on ERS parameters.The aim is to drop the packets that are exhausting the network energy whereas forward the packets nearer to the destination with priority.Extensive simulations are carried out for network scalability,node speed and network terrain size.Our results show that the proposed models attain evident performance enhancement.
文摘Most of the existing routing protocols for heterogeneous multi-hop wireless networks （HWMNs） use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes＇ location information （TSRAL） is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.
基金Supported by the National Natural Science Foundation of China under Grant No. 60872018,60721002,60875038the National Basic Research 973 Program of China under Grant No. 2007CB310607+2 种基金SRFDP Project under Grant No. 20070293001the Science and Technology Support Foundation of Jiangsu Province under Grant No. BE2009142 and BE2010180the Scientific Research Foundation of Graduate School of Nanjing University under Grant No. 2011CL07
文摘Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.
