检索结果-南通市图书馆

Vector Segment routing for Large-Scale Multilayer Satellite Network

Journal of Communications and Information Networks 2023年第1期8卷 24-36页

作者： Weigang Bai Hongming Yang Jincheng Tong Zhaotao Qin Ruochen Lyu Xidian University Xi’an 710000 Science and Technology on Communication Networks Laboratory Shijiazhuang 050000China China Academy of Space Technology Beijing 100000China

With the expansion of satellite constellation,routing techniques for small-scale satellite networks have problems in routing overhead and forwarding efficiency.This paper proposes a vector segment routing method for large-scale multi layer satellite networks.A vector forwarding path is built based on the location between the source and the destination.Data packets are forwarded along this vector path,shielding the influence of satellite motion on routing forwarding.Then,a dynamic route maintenance strategy is suggested.In a multi layer satellite network,the low-orbit satellites are in charge of computing the routing tables for one area,and the routing paths are dynamically adjusted in the area in accordance with the network.The medium-orbit satellites maintain the connectivity of vector paths in multiple segmented areas.The forwarding mode based on the source and destination location improves the forwarding efficiency,and the segmented route maintenance mode decreases the routing overhead.The simulation results indicate that vector segment routing has significant performance advantages in end-to-end delay,packet loss rate,and throughput in a multi layer satellite network.We also simulate the impact of routing table update mechanism on network performance and overhead and give the performance of segmented vector routing in multi layer low-orbit satellite networks.

关键词： routing technique routing overhead vector segment routing network load throughput

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Semi Markov process inspired selfish aware co-operative scheme for wireless sensor networks(SMPISCS)

引用

Cybersecurity 2019年第1期2卷 76-90页

作者： Kanchana Devi V Ganesan R School of Computing Science and Engineering VIT University Chennai CampusChennaiTamilNaduIndia

In Wireless Sensor Network(WSN),energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation signifies the performance of the network in terms of increased throughput,packet delivery rate and decreased delay depending on the data being aggregated and level of control overhead.The performance of a sensor network is highly inclined by the selfish behaving nature of sensor nodes that gets revealed when the residual energy ranges below a bearable level of activeness in packet forwarding.The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate.Semi Markov Process Inspired Selfish aware Co-operative Scheme(SMPISCS)is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network.SMPISCS model provides a kind of sensor node’s behavior for quantifying and future forecasting the probability with which the node could turn into selfish.Simulation experiments are carried out through Network Simulator 2 and the performance are analyzed based on varying the number of selfish sensor nodes,number of sensor nodes and range of detection threshold.

关键词： Information security routing overhead Selfish sensor nodes Semi Markov process Wireless sensor networks

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

AODV-Clustering routing Protocol for Large Tactical Mobile Ad Hoc Network

AODV-Clustering Routing Protocol for Large Tactical Mobile A...

引用

第十三届中国体视学与图像分析学术会议

作者： Haibo Jiang Yaofei Ma Dongsheng Hong Xiaole Ma School of Automation Science and Electrical Engineering Beihang University

MANET is generally employed in military and emergencies due to its flexibility and easy-touse. However,most flat routing protocols flood their route request(RREQ) packets to overall network which will lead to high routing overhead and poor performance.As a result,these routing protocols cant perform well when the network grows larger,or the nodes are moving faster.To address this issue,this paper proposes a cluster based routing protocol named AODV-clustering,which partitions the network into several clusters.The experiments are conducted using NS2.34,and the results demonstrate that the proposed protocol can improve the network performance by decreasing the routing overhead and increasing the packet delivery ratio.

关键词： AODV AODV-clustering routing overhead packet delivery ratio NS2

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：