检索结果-内蒙古大学图书馆

Research on network coding aware energy efficient routing for wireless sensor networks

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2018年第1期2018卷 1页

作者： Shao, Xing Wang, Cuixiang Gao, Jun Yancheng Inst Technol Coll Informat Engn Yancheng 224051 Peoples R China Arizona State Univ Ira A Fulton Sch Engn Phoenix AZ 85281 USA

Wireless sensor nodes in wireless sensor networks are generally battery powered and it is usually hard to change their batteries. Therefore, energy saving has always been the basic critical problem of wireless sensor networks. In recent years, network coding has become a promising technology to improve network throughput, reduce transmission number, and save energy, which has great potential to solve the energy efficiency problem of wireless sensor networks. In addition, some network coding aware routings have been proposed. However, the network coding condition of existing network coding aware routings may experience the problem of false-coding effect in some scenarios, and usually neglect node energy, which greatly influences the energy efficiency performance. Therefore, existing network coding aware routings are not suitable for wireless sensor networks. This paper proposes network coding aware energy efficient routing (NAER) for wireless sensor networks. In NAER, universal network coding condition is presented and proved to avoid false-coding problem. Besides, combined with the coverage control and topology control mechanism at lower layer, cross layer coding opportunity discover mechanism is presented to increase coding opportunities. In addition, a network coding aware energy efficient routing metric (NERM) is presented, which takes coding opportunity, node energy, and link quality into account jointly. Simulation results demonstrate that NAER improves the accuracy of coding discovery mechanism, increases the number of coding opportunities, saves node's energy consumption, and prolongs network lifetime.

关键词： Network coding aware Energy efficient routing algorithm Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Impact of ZRP Zone Radius Value on Wireless Network Performance 10th

引用

10th European-Alliance-for-Innovation (EAI) International Conference on E-Infrastructure and E-Services for Developing Countries (AFRICOMM)

作者： Yelemou, Tiguiane Zerbo, Boureima Dandjinou, Mesmin Tounde Sie, Oumarou Univ Nazi BONI Bobo Dioulasso Burkina Faso Univ Ouaga 1 Prof Joseph Ki Zerbo Ouagadougou Burkina Faso

ISBN: (纸本)9783030160425;9783030160418

In this paper, we highlight the impact of the routing load on the performance of ad hoc wireless networks. Specifically, we analyze Zone routing Protocol (ZRP) routing load and the impact of zone radius value on this protocol performance. First, we show that performance parameters curves such as routing overhead, Packet Delivery Ratio and End-to-End Delay don't evaluate monotonously according to zone radius value. In our test context, we note optimal values for routing overhead and Packet Delivery Ratio (PDR) when R = 3. For delay, minimal values are observed when R = 1 and R = 4. Second, we study this hybrid protocol routing overhead according to network density and compare it to pure on-demand and table-driven routing approaches. Contrary to that is largely presented, in realistic wave propagation model context, taking into account obstacles and their effects such as multi-path one, proactive routing approach performs better than reactive one. In fact, in lossy link context, route request and route error packets broadcasted are significant. In dense network, ZRP, due to its multitude control packets, performs the worst for routing overhead and packet delivery ratio (PDR) parameters.

关键词： Wireless networks routing algorithm Zone routing Protocol Zone radius Realistic simulation conditions

来源：评论

学校读者我要写书评

暂无评论

Exploiting Active Subareas for Multicopy routing in VDTNs

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第5期67卷 4374-4388页

作者： Wu, Bo Shen, Haiying Chen, Kang Clemson Univ Elect & Comp Engn Clemson SC 29634 USA Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA Southern Illinois Univ Carbondale Dept Elect & Comp Engn Carbondale IL 62901 USA

In Vehicle Delay Tolerant Networks (VDTNs), current routing algorithms select relay vehicles based on either vehicle encounter history or predicted future locations. The former method may fail to find relays that can encounter the target vehicle in a large-scale VDTN while the latter method may not provide accurate location prediction due to traffic variance. Therefore, these methods cannot achieve high performance in terms of routing success rate and delay. In this paper, we aim to improve the routing performance in VDTNs. We first analyze vehicle network traces and observe that 1) each vehicle has only a few active sub-areas that it frequently visits, and 2) two frequently encountered vehicles usually encounter each other in their active sub-areas. We then propose Active Area based routing method (AAR) which consists of two steps based on the two observations correspondingly. AAR first distributes a packet copy to each active sub-area of the target vehicle using a traffic-considered shortest path spreading algorithm, and then in each sub-area, each packet carrier tries to forward the packet to a vehicle that has high encounter frequency with the target vehicle. Extensive trace-driven simulation demonstrates that AAR produces higher success rates and shorter delay in comparison with the state-of-the-art routing algorithms in VDTNs. Also, the simulation shows that our advanced AAAR has better performances than our AAR.

关键词： VDTN active area routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Density Based Smart Traffic Control System for Congregating Traffic Information

Density Based Smart Traffic Control System for Congregating ...

引用

International Conference on Intelligent Computing and Control Systems (ICCS)

作者： Amaresh, A. M. Bhat, Kavya Shivanand Ashwini, G. Bhagyashree, J. Aishwarya, P. GSSSIETW Dept ISE Mysuru India

ISBN: (纸本)9781538681138

Traffic control is a major problem in urban areas;advanced technology is required to maintain efficient traffic. The current method used such as human control or the timer is not able to solve the crisis completely. This paper proposes a system which will measure the traffic based on the density of the vehicles within the particular longitude and latitude. This splendid traffic control system offers efficient management of traffic and reliability over the existing systems. Other than providing the efficient traffic management system also provides the subscriber about the famous places, Hotels, and Events occurring near the traffic.

关键词： Density based Traffic control Priority Based scheduling algorithm routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cross-Layer Optimization algorithm Based on Power Control for Wireless Sensor Network 10

A Cross-Layer Optimization Algorithm Based on Power Control ...

引用

10th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Zhang, Deyu Zhou, Min Lv, Yanhui Jiao, Le Shenyang Ligong Univ Coll Informat Sci & Engn Shenyang Peoples R China

ISBN: (纸本)9781728109459

In wireless sensor network, the main functions of MAC layer and network layer are to detect collision, allocate channel resource, select paths, and transmit information and so on. Aiming at solving such problems between protocol layers in wireless sensor network as relative independence, with no information sharing, failure to satisfy network needs in time, incongruity between the transmit power of network nodes and network energy and so on, a cross-layer optimization algorithm based on power control is proposed to avoid network congestion and save network energy. The simulation results show that the PCSC algorithm is able to enhance network throughput, save network energy and extend network lifetime compared to other algorithms.

关键词： wireless sensor network cross-layer optimization power control routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Delay Tolerant Network routing Policy Based on Optimized Control information Generation Method

引用

IEEE ACCESS 2018年 6卷 51791-51803页

作者： Wang, Hezhe Wang, Huiqiang Tan, Jing Lv, Hongwu Zhu, Meijin Harbin Engn Univ Coll Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China

Current research examining delay tolerant network (DTN) routing policies mostly focuses on network environments with relatively abundant resources and lacks consideration of resource-constrained special network environments. To overcome this limitation, a resource-constrained DTN routing policy (RC-RP) based on an optimized control information generation method is proposed. In contrast to traditional DTN routing policies, RC-RP can utilize local node resources to select the relay node and perform copy control according to the optimized control information to achieve a better overall network performance. The simulation results show that the performance of the RC-RP routing policy is clearly superior to that of the epidemic routing policy, SAW routing policy, and RBL routing policy.

关键词： DTN opportunistic network routing algorithm optimal control

来源：评论

学校读者我要写书评

暂无评论

Secure routing for Multihop Ad Hoc Networks With Inhomogeneous Eavesdropper Clusters

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第11期67卷 10660-10670页

作者： Chen, Gaojie Coon, Justin P. Tajbakhsh, Shahriar Etemadi Univ Leicester Dept Engn Leicester LE1 7RH Leics England Univ Oxford Dept Engn Sci Oxford OX1 313 England

This paper studies finding the secure path according to the secrecy connectivity probability (SCP) in the multihop ad hoc networks in the presence of inhomogeneous eavesdropper clusters. We consider both random and fixed eavesdropper clusters, where the former case assumes that there is no knowledge of the locations of the clusters and the latter case assumes that the locations of the clusters can be estimated accurately. First, we derive the end-to-end SCP to characterize the secrecy performance of a given path in a general multihop wireless network with half-duplex randomize-and-forward relaying. Then, we consider a full-duplex scheme at the legitimate receiver, which receives the useful information while broadcasting a jamming signal to the potential eavesdroppers to further enhance the secrecy connectivity. Then, a novel secure routing algorithm that can provide the maximum SCP for any legitimate transmitter/receiver pair in a distributed manner is proposed. The theoretical analysis is verified by Monte Carlo simulation results. The results show that our secure routing algorithm provides similar results compared to an exhaustive search. For the random eavesdropper cluster case, the optimal mute is independent of the knowledge of the cluster, which is the same as the homogeneous eavesdropper case. However, for the case where eavesdropper clusters are fixed and their locations are known a priori, the optimal path selection depends on the radii and locations of the eavesdropper clusters and the average number of eavesdroppers in each cluster.

关键词： Multi-hop ad hoc networks physical layer security stochastic geometry full-duplex routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The Minimum Delay routing algorithm for WOBAN

The Minimum Delay Routing Algorithm for WOBAN

引用

3rd International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)

作者： Ke Geng Ma Ying-ping Cao Wen-ting PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China PLAUST Postgrad Team ICE 1 Nanjing 210007 Jiangsu Peoples R China PLAUST Postgraduate Team ICE 3 Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9780769551227

The hybrid wireless-optical broadband access network (WOBAN) is a novel promising hybrid access network. We can improve its performance effectively by improving the wireless network routing algorithm of it. This paper proposes a novel routing algorithm - the minimum delay routing algorithm (MDRA). In the algorithm, A time delay estimation method is combined with the Dijkstra algorithm used in the routing algorithm for front-end wireless Mesh network (WMN) of WOBAN. Simulation results show that the delay and TDR performances of MDRA are better than that of the minimum hop algorithm (MHRA) in high load conditions in WOBAN.

关键词： WOBAN Dijkstra routing algorithm time delay the shortest path

来源：评论

学校读者我要写书评

暂无评论

Joint Hybrid Transmission and Adaptive routing for Lifetime Extension of WSNs

引用

IEEE ACCESS 2018年 6卷 21658-21667页

作者： Yu, Chin-Min Ku, Meng-Lin Chung Hua Univ Dept Elect Engn Hsinchu 300 Taiwan Natl Cent Univ Dept Commun Engn Taoyuan 320 Taiwan

In this paper, two hybrid multi-hop/single-hop opportunistic transmission strategies with adaptive routing are investigated for prolonging the network lifetime of wireless sensor networks (WSNs). To achieve this goal, a systematic decision model that contains a network distribution block, a routing algorithm block, a traffic pattern block, and an optimal policy block is presented to determine the optimal transmission probability of each node. With packet transmission via adaptive shortest paths, two optimization strategies are proposed in the optimal policy block: a power efficiency optimization strategy and a power utilization optimization strategy. The power efficiency strategy aims to minimize the overall power consumption and the power utilization strategy endeavors to minimize the maximum power consumption among nodes. Computer simulations show that the power utilization strategy can achieve almost triple the network lifetime extension compared with the power efficiency strategy. Furthermore, the power utilization strategy is superior to the power efficiency strategy in terms of residual energy utilization for various network sizes.

关键词： Wireless sensor networks topology distribution network lifetime routing algorithm optimization strategy

来源：评论

学校读者我要写书评

暂无评论

Quantum Key Distribution Network： Optimal Secret- Key- Aware routing Method for Trust Relaying

引用

China Communications 2018年第2期15卷 33-45页

作者： Chao Yang Hongqi Zhang Jinhai Su Science and Technology Information Research Institute Zhengzhou Henan China

Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.

关键词： quantum key distribution QKDnetwork routing algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：