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

Improving Lifetime of Wireless Sensor Network Based on Sinks Mobility and Clustering routing

WIRELESS PERSONAL COMMUNICATIONS 2019年第3期109卷 2011-2024页

作者： Amini, S. M. Karimi, A. Shehnepoor, S. R. Islamic Azad Univ Fac Tech & Comp Engn Sci & Res Branch Tehran Iran Islamic Azad Univ Qazvin Branch Fac Comp & Informat Technol Engn Qazvin Iran Sharif Univ Technol Fac Comp Engn Tehran Iran

Previous studies on wireless sensor networks indicate one of the most important research topics is to consider both significance of the reduction in sensor nodes energy consumption and improving network lifetime. Regarding results of some researchers using sinks, mobility has a substantial impact on the performance of sensor networks concerning reducing total energy consumption, increasing the number of active nodes and solving the energy-hole problem. In this study, we consider hexagons beehives feature where sensor nodes are distributed across a hexagon randomly. This hexagonal is divided into equal clusters based on the radius of hexagonal. Also, the need for cluster heads to be close to their centre of clusters in the previous similar model is solved by adding mobility to the sinks, providing a pre-determined path for mobile sinks and covering each cluster by sinks from two different directions. Therefore, the proposed model simulation results show the increase in the average of residual energy between sensor nodes, reducing total energy consumption, increasing the number of active nodes and ultimately improving the lifetime of wireless sensor networks related to previous models.

关键词： Wireless sensor networks Multiple mobile sinks routing algorithm Improving lifetime Reduce energy consumption

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of BATMAN-adv Wireless Mesh Network routing algorithms 5

Performance Evaluation of BATMAN-adv Wireless Mesh Network R...

引用

5th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud) / 4th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)

作者： Liu, Ligang Liu, Jianpo Qian, Hanwang Zhu, Jun Chinese Acad Sci Sci & Technol Microsyst Lab Shanghai Inst Microsyst & Informat Technol 865 Changning Rd Shanghai 200050 Peoples R China

ISBN: (纸本)9781538658505

This paper describes our performance evaluation results of BATMAN-adv wireless mesh network routing algorithms, particularly its new variant, version V. The BATMAN protocol has developed continuously after its initial release and now several variants are available, especially the transmission quality based BATMAN-adv version IV and the throughput based version V. The version IV has deployed and tested in many publications. However, the version V has not been verified in literature. We here design several test cases to compare the performance between version IV and V and the results are presented. It shows that the version V does not outperform the version IV in terms of delay, pack loss and throughput. It is suggested that the adjustable parameters of the version V should be studied carefully in the future.

关键词： wireless mesh network ad hoc batman-adv performance evaluation routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Agent routing algorithm in Wireless Sensor Networks

Agent Routing Algorithm in Wireless Sensor Networks

引用

4th International Conference on Graphic and Image Processing (ICGIP)

作者： Zhang Yuqing Yang Shuqun Fujian Normal Univ Fac Software Fuzhou Peoples R China

ISBN: (纸本)9780819495662

Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.

关键词： Agent wireless sensor network energy consumptio routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Test Strategy and Fault-Tolerant routing algorithm for NoC Routers

A Novel Test Strategy and Fault-Tolerant Routing Algorithm f...

引用

17th CSI International Symposium on Computer Architecture and Digital Systems (CADS)

作者： Alamian, Sanaz Sadat Fallahzadeh, Ramin Hessabi, Shaahin Alirezaie, Javad Sharif Univ Technol Dept Comp Engn Tehran Iran Ryerson Univ Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781479905621;9781479905638

In this paper, we present a novel routing algorithm in order to avoid deadlock and packet dropping. In our proposed algorithm the network-on-chip (NoC) is capable of tolerating faults in presence of control faults in combinational parts of routers. In addition, by modifying the functionality of the router, the router is enabled to test its own, as well as the preceding router's functionality based on the routing algorithm, destination address and previous router's situation. Each router recognizes the faulty neighbor and announces it to successive routers. In this scheme no extra packets will be generated. We analyze the effects of our method on latency, power consumption and drop rate. Our experimental results illustrate that, fault coverage for routers can reach up to 100% with yet low power consumption and significant improvement in latency compared to the baseline approach.

关键词： NoC Routers Fault-tolerant NoC Functional Test routing algorithm Latency

来源：评论

学校读者我要写书评

暂无评论

Research of WirelessHART network layer routing algorithm

Research of WirelessHART network layer routing algorithm

引用

2nd International Conference on Measurement, Instrumentation and Automation (ICMIA 2013)

作者： Wu Zhen-zhen Henan Univ Sci & Technol Coll Elect & Informat Engn Luoyang 471003 Peoples R China

ISBN: (纸本)9783037857519

WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. routing algorithm performance directly determines sensor nodes how to transfer and control data, and the effective data rate. The algorithm which affects the energy consumption and lifetime of the whole sensor network is the core content of the network layer. WirelessHART network layer routing algorithm includes Source Route and Graph Route. In this paper, WirelessHART routing algorithm is simulated using nesC language in the TinyOS, and then compares with AODV protocol. And the data of experiment show the application advantage of Wireless HART Graph Route.

关键词： WirelessHART routing algorithm TinyOS

来源：评论

学校读者我要写书评

暂无评论

Quality of Service Aware routing Protocol in Software-Defined Internet of Vehicles

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第2期6卷 2817-2828页

作者： Ghafoor, Kayhan Zrar Kong, Linghe Rawat, Danda B. Hosseini, Eghbal Sadiq, Ali Safaa Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 44045 Peoples R China Howard Univ Dept Elect Engn & Comp Sci Washington DC 20059 USA Cihan Univ Fac Sci Dept Comp Sci Erbil Iraq Monash Univ Sch Informat Technol Subang Jaya 47500 Malaysia

Software-defined Internet of Vehicles (SDIoV) has emerged as a promising field of study as it could overcome the shortcomings of traditional vehicular networks, such as offering efficient data transmission and traffic shaping in different vehicular scenarios to satisfy all the requirements of applications on the fly. Although routing solutions are lightly addressed for SDIoV, there are many limitations of routing protocols unaddressed in such environment. More precisely, shortest path routing algorithms are mostly focused in the state of the arts. This paper presents quality of service aware routing algorithm that forwards packets toward the most reliable and connected path to the destination. Particularly, candidate routes should satisfy metrics, such as signal to interference and noise ratio (SINR) constraint and have the highest probability of connectivity. To address these issues, we have formulated a discrete optimization problem to favor the best route among candidate paths and proposed the modified laying chicken algorithm (LCA) that results better results than the traditional approaches. We have mathematically analyzed the probability of connectivity along with the SINR metric. Moreover, a multiscore function based on traffic density and greediness factor is proposed to make intelligent decision at the intersections. Simulation results are used to validate the superiority of the proposed routing approach over the existing solutions.

关键词： Laying chicken algorithm (LCA) quality of service routing algorithm software-defined Internet of Vehicles (SDIoV)

来源：评论

学校读者我要写书评

暂无评论

Novel routing protocol scheme for real-time applications in mobile Ad Hoc networks

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第1-Sup期22卷 977-988页

作者： Lee, Dong Chun Lee, Do Hyeon Bluwise Inc R&D Ctr Daejeon City South Korea ShinSung C&T Inc R&D Ctr Seoul South Korea

In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.

关键词： Mobile Ad Hoc routing protocol routing algorithm Relay region MANETs

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm Based on Social Awareness in DTNs

An Efficient Routing Algorithm Based on Social Awareness in ...

引用

77th IEEE Vehicular Technology Conference (VTC)

作者： Wang, Kun Guo, Huang Wu, Meng Yang, Zhen Liu, Yan Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Comm & Sensor Netw Tec Nanjing 210003 Jiangsu Peoples R China Nanjing Univ Technol Coll Automat & Elect Engn Nanjing 210009 Peoples R China

ISBN: (纸本)9781467363372

This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and the overhead, and increases the successful delivery ratio, thereby improving the routing efficiency.

关键词： DTNs(Delay Tolerant Networks) social awareness routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Deadlock-Free routing algorithm Requiring No Virtual Channel on 3D-NoCs with Partial Vertical Connections

A Deadlock-Free Routing Algorithm Requiring No Virtual Chann...

引用

7th IEEE/ACM International Symposium on Networks-on-Chip (NoCS)

作者： Lee, Jinho Choi, Kiyoung Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151 South Korea

ISBN: (纸本)9781467364911;9781467364928

Elevator-first routing algorithm has been introduced for partially connected 3D network-on-chip as a low-cost, distributed and deadlock-free routing algorithm using two virtual channels. This paper proposes Redelf, a modification of the elevator-first routing algorithm on a 3D mesh topology. The proposed algorithm requires no virtual channel to ensure deadlock-freedom.

关键词： NoC deadlock routing algorithm 3D stacking

来源：评论

学校读者我要写书评

暂无评论

A Direct Approach of Path Planning Using Environmental Contours

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2021年第1期101卷 3-3页

作者： Yu, Hongjun Liang, Lihua Shi, Peng Jiang, Qing Harbin Engn Univ Coll Intelligent Syst Sci & Engn Harbin 150001 Peoples R China Univ Adelaide Sch Elect & Elect Engn Adelaide SA 5005 Australia

Roadmap is important in typical robotic applications and it is not a trivial task to obtain in unknown space. In this paper, we propose a novel approach to calculate the roadmap that is robust against noisy environmental contours and the movement of the robot. In order to obtain full visibility to space, we design a direct space partitioning approach to produce the roadmap. It uses readings from rangefinders to establish sequential polygons in time, and as the robot moves, intersections among polygons are iteratively obtained. After iterations of updates, we obtain a number of polygons with stable forms. Based on the connections among the polygons, we obtain a roadmap and propose a routing algorithm to calculate paths between points in space. Simulation examples are provided to demonstrate the performance of the proposed approach.

关键词： Space partitioning Roadmap routing algorithm Environmental contours

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：