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

A distributed routing algorithm for Data Collection in Low-Duty-Cycle Wireless Sensor Networks

IEEE INTERNET OF THINGS JOURNAL 2017年第5期4卷 1420-1433页

作者： Liu, Feng Wang, Yufei Lin, Mu Liu, Kai Wu, Dapeng Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan 430079 Hubei Peoples R China Beijing Key Lab Network Based Cooperat Air Traff Beijing 100191 Peoples R China Beijing Lab Gen Aviat Technol Beijing 100191 Peoples R China Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

In order to prolong the lifetime of wireless sensor networks (WSNs), a low-duty-cycle mode is widely used to save the energy for sensor nodes. Under this mode, sensor nodes switch between active and dormant states, which incurs a high latency for traditional routing algorithms. To mitigate this, in this paper, the data collection problem in low-duty-cycle WSNs is formulated as a delay optimization problem of traffic flow with consideration of both congestion and collision, which is solved by a distributed algorithm based on network utility maximization. Our proposed distributed routing algorithm achieves a better tradeoff between latency and energy conservation than existing schemes, and our schemes can find a nearly global-optimal-path to achieve almost minimum average end-to-end (E2E) delay with less energy consumption. The computation complexity and energy consumption of the distributed algorithm are analyzed and evaluated in detail. The simulation results show that the proposed algorithm can achieve almost the same average E2E delay performance as the global optimal algorithm with less energy, and reduce the average E2E delay by about 30% than the shortest path algorithm when the data generation rate is high.

关键词： Data collection distributed routing algorithm low-duty-cycle wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

An improved distributed routing algorithm for Benes based optical NoC

An improved distributed routing algorithm for Benes based op...

引用

Conference on International Conference on Image Processing and Pattern Recognition in Industrial Engineering

作者： Zhang, Jing Gu, Huaxi Yang, Yintang Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Inst Microelect Xian Peoples R China

ISBN: (纸本)9780819483294

Integrated optical interconnect is believed to be one of the main technologies to replace electrical wires. Optical Network-on-Chip (ONoC) has attracted more attentions nowadays. Benes topology is a good choice for ONoC for its rearrangeable non-blocking character, multistage feature and easy scalability. routing algorithm plays an important role in determining the performance of ONoC. But traditional routing algorithms for Benes network are not suitable for ONoC communication, we developed a new distributed routing algorithm for Benes ONoC in this paper. Our algorithm selected the routing path dynamically according to network condition and enables more path choices for the message traveling in the network. We used OPNET to evaluate the performance of our routing algorithm and also compared it with a well-known bit-controlled routing algorithm. ETE delay and throughput were showed under different packet length and network sizes. Simulation results show that our routing algorithm can provide better performance for ONoC.

关键词： ONoC Benes network distributed routing algorithm bit-controlled routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Region based Source distributed routing algorithm for Sink Mobility in Underwater Sensor Network

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年第1期233卷

作者： Pradeep, Shanmugam Bapu, Tapas Bapu Bathey Ramesh Rajendran, Radhika Anitha, Ramachandran SA Engn Coll Dept Elect & Commun Engn Chennai India SA Engn Coll Dept Comp Applicat Chennai India

The residual nodes energy consumption is a primary factor to extend the lifespan of network. Utilizing a sensor node's very low-power battery in Underwater Wireless Sensor Networks (UWSNs) is still a difficult task. To increase the network lifespan, this paper proposes an Energy Efficient Region based Source distributed routing algorithm for Sink Mobility in Underwater Sensor Network (EERSDRA-GCOP-UWSN). The proposed work consists of three Phases that are initialization phase, routing Phase and Data transmission. For initialization phase, sinks and the sensor nodes are initialized. For routing phase, Energy EERSDRA with sink mobility is employed to identify the region of sensor nodes. For data transmission phase, Geographic and Cooperative Opportunistic Protocol is proposed to select the best relay node on the basis of depth fitness factor. The proposed EERSDRA-GCOP-UWSN is evaluated with the performance metrics. Then performance of the EERSDRA-GCOPUWSN proposed method provides 18.409%, 13.843% and 23.768% high Network lifetime, 27.744%, 24.881% and 19.703% low energy consumption, 17.346%, 20.852% and 26.347% high throughput and 16.385%, 20.416% and 22.907% high PDR when compared to the existing methods such as, Energy-efficient regional based cooperative routing protocol with sink mobility for UWSN (EERCRP-UWSN), a safe energy efficient and cooperative routing protocol for UWSN (SEECRP-UWSN), geo-opportunistic routing protocols for improving the residual energy range (EEGORP-UWSN) methods respectively. Finally, the performance of the proposed method achieves better result while compared to the existing methods.

关键词： Energy Efficient Region based Source distributed routing algorithm Underwater wireless sensor networks Cooperative opportunistic protocol

来源：评论

学校读者我要写书评

暂无评论

Study on the distributed routing algorithm and Its Security for Peer-to-Peer Computing

引用

Journal of Electronic Science and Technology of China 2005年第2期3卷 187-188页

作者： ZHOUShi-jie SchoolofComputerScienceandEngineeringUniversityofElectronicScienceandTechnologyofChinaChengdu610054China

By virtue of its great efficiency and graceful architecture, the Client/Server model has been prevalent for more than twenty years, but some disadvantages are also recognized. It is not so suitable for the next generation Internet (NGI), which will provide a high-speed communication platform. Especially, the service bottleneck of Client/Server model will become more and more severe in such high-speed networking environment. Some approaches have been proposed to solve such kind of disadvantages. Among these, distributed computing is considered an important candidate for Client/Server model.

关键词： peer-to-peer computing P2P distributed computing information security distributed routing algorithm bidding-electing algorithm one-way accumulator

来源：评论

学校读者我要写书评

暂无评论

Two-level distributed clustering routing algorithm based on unequal clusters for large-scale Internet of Things networks

引用

JOURNAL OF SUPERCOMPUTING 2020年第3期76卷 2158-2190页

作者： Amini, S. M. Karimi, A. Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Islamic Azad Univ Qazvin Branch Fac Comp & Informat Technol Engn Qazvin Iran

According to the recent advancements in communication technologies and the widespread use of smart devices, our environment can be transforming into the Internet of Things (IoT) because it can connect the physical, cyber, and biological world via smart sensors for different purposes. Wireless sensor networks are considered as one of the main infrastructures in the IoT systems. Therefore, decreasing the total energy consumption of sensor nodes and prolonging the network longevity are two important challenges that should be considered. To increase energy efficiency and to improve the network longevity, a two-level distributed clustering routing algorithm based on unequal clusters has been proposed for large-scale IoT systems. The main idea is to decrease the data transmission distances between member nodes and cluster heads to mitigate the hot spot problem by distributing two cluster heads in each cluster, which in turn leads to energy conservation and load balancing. The clustering method is two level due to the benefits it offers for the sensor nodes. First, each node can transfer its data to the nearest cluster head because a primary cluster head and a secondary cluster head have been considered for each cluster. Therefore, the nodes far from the primary cluster head can be organized based on their distances to the closest cluster head to reduce their data transmission distances to the cluster heads. Second, two cluster heads can be replaced with each other in different circumstances. This reduces the overhead of the cluster head selection algorithm in the proposed scheme. Third, the sensor nodes can benefit from the primary and secondary cluster heads to transfer the data to the sink through different paths with the minimum energy consumption. Simulation results indicate that the proposed algorithm has better performance in terms of total energy consumption, total network energy, and network longevity compared to previous similar schemes.

关键词： Wireless sensor network distributed routing algorithm Two-level clustering Unequal clusters Internet of Things

来源：评论

学校读者我要写书评

暂无评论

A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1997年第10期E80B卷 1493-1501页

作者： Pornavalai, C Chakraborty, G Shiratori, N UNIV AIZU MULTIMEDIA SYST LAB AIZU WAKAMATSU 96580 JAPAN

distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called ''DQoSR,'' for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(\V\(2)), where \V\ is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

关键词： distributed routing algorithm real-time communication guaranteed QoS service resource reservation distributed multimedia applications high-speed networks

来源：评论

学校读者我要写书评

暂无评论

RESEARCH AND SIMULATION OF distributed QOS routing algorithm

RESEARCH AND SIMULATION OF DISTRIBUTED QOS ROUTING ALGORITHM

引用

2nd IEEE International Conference on Broadband Network and Multimedia Technology

作者： Zhu Daxin Cai Danlin Quanzhou Normal Univ Sch Sci Quanzhou Fujian Peoples R China

ISBN: (纸本)9781424450053

Base on the QOS requirements of modern broadband networking, the paper presents our recent research on QOSPF in the on-demand computing over the traditional OSPF. The disadvantage in a distributed routing protocol under the QOS requirement is firstly discussed;then a new QOSPF which supports the QOS routing scheme is proposed. The advantage of new approach is demonstrated in the simulation of OSPF and QOSPF through the NS-2. Limitation of the method and future research for improvement are also discussed.

关键词： distributed routing algorithm Quality of Service QOSPF

来源：评论

学校读者我要写书评

暂无评论

Research on distributed QoS routing algorithm Fallback++ Based on Transaction and Multiobjective Programming

Research on Distributed QoS Routing Algorithm Fallback++ Bas...

引用

2016 2nd International Conference on Mechanical,Electronic and Information Technology Engineering(ICMITE 2016)

作者： Feng Jie Deng Jin Yang Wang Qin Dalian Naval Academy

Transaction classification and QoS parameter Constraints are first researched. Then distributed QoS routing algorithm Fallback++ based on transaction and multiobjective programming is designed. Finally the time complexity and space complexity of the algorithm are analyzed. Simulation results show that Fallback++ is more efficient than Fallback and Fallback+.

关键词： Transaction classification distributed routing algorithm QoS Time complexity Simulation

来源：评论

学校读者我要写书评

暂无评论

RESEARCH AND SIMULATION OF distributed QOS routing algorithm

RESEARCH AND SIMULATION OF DISTRIBUTED QOS ROUTING ALGORITHM

引用

2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology（IC-BNMT2009）

作者： Zhu Daxin, Cai Danlin School of Science, Quanzhou Normal University, Fujian, China

关键词： distributed routing algorithm Quality of Service QOSPF

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1998年第6期6卷 828-837页

作者： Jia, XH City Univ Hong Kong Dept Comp Sci Kowloon Peoples R China

Multicast routing is to find a tree which is rooted from a source node and contains all multicast destinations, There are two requirements of multicast routing in many multimedia applications: optimal network cost and bounded delay, The network cost of a tree is defined as the sum of tbe cost of all links in the tree. The bounded delay of a routing tree refers to the feature that the accumulated delay from the source to any destination along the tree shall not exceed a prespecified hound. This paper presents a distributed heuristic algorithm which generates routing trees having a suboptimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages and convergence time, and flexible in dynamic membership changes. A large amount of simulations have been done to show the network cost of the routing trees generated by our algorithm is similar to, or even better than, other existing algorithms.

关键词： delay-bounded multicast distributed routing algorithm multicast routing multimedia systems real-time communications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：