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

Sink-oriented tree based data dissemination protocol for mobile sinks wireless sensor networks

WIRELESS NETWORKS 2018年第7期24卷 2723-2734页

作者： Hawbani, Ammar Wang, Xingfu Kuhlani, Hassan Karmoshi, Saleem Ghoul, Rafia Sharabi, Yaser Torbosh, Esa Univ Sci & Technol China Hefei Anhui Peoples R China Hunan Univ Changsha Hunan Peoples R China Hefei Univ Technol Hefei Anhui Peoples R China

Data dissemination toward static sinks causes the nearby nodes to deplete their energy quicker than the other nodes in the field (i.e., this is referred to as the hotspot problem). Accordingly, topology disruptions will occur and no data will be delivered to the sink. Mobile sinks are proposed to solve the hotspot problem in wireless sensor networks;they provide a load balancing and an energy consumption balancing for the whole network. However, sink mobility introduces new challenges (e.g., frequent location updates and packets delay). In this paper, we proposed a distributed sink-oriented dissemination protocol called Sink-oriented Tree based Data Dissemination (STDD). STDD constructs just one main dissemination tree for each mobile sink. When the access node is changed, the main tree will be updated and maintained to guarantee the shortest path to the mobile sinks. The updated and maintained tree is not a new tree;however, it is just a new version with only a few changes in a few levels of the main tree itself. Simulations show that STDD achieves a significant performance in terms of latency, network lifetime, delivery rate, and energy consumption compared with the state-of-the-art approaches.

关键词： Mobile sink distributed routing Data dissemination Energy efficiency Mobility Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

FRCA: A Novel Flexible routing Computing Approach for Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2020年第11期19卷 2623-2639页

作者： Liu, Ping Wang, Xingfu Hawbani, Ammar Busaileh, Omar Zhao, Liang Al-Dubai, Ahmed Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Anhui Peoples R China Shenyang Aerosp Univ Shenyang 110136 Liaoning Peoples R China Edinburgh Napier Univ Sch Comp Edinburgh EH11 4DY Midlothian Scotland

In wireless sensor networks, routing protocols with immutable network policies lacking the flexibility are generally incapable of maintaining effective performance due to the complicated and rapidly changing environment situations and application requirements. The proposed "Flexible routing Computing Approach (FRCA)" is a novel distributed and probabilistic computing approach capable of modifying or upgrading routing policies on the fly with low cost, which effectively enhances the routing flexibility. FRCA models the routing metric as a forwarding probability distribution for routing decisions. This model depends on three elements, the physical quantities collected at sensor nodes, the built-in base math functions, and the routing parameters. These elements are all user-oriented and can be specified to implement multifarious complicated network policies meeting different performance requirements. More significantly, through distributing routing parameters from the sink to end nodes, operators are allowed to adjust network policies on the fly without interrupting the network services. Through extensive performance evaluation studies and simulations, the results demonstrate that routing protocols designed based on FRCA could achieve better performance compared to its state-of-the-art counterparts regarding network lifetime, energy consumption, and duplicate packets as well as ensure high flexibility during network policies modification or upgrade.

关键词： routing Wireless sensor networks routing protocols Measurement Mobile computing Computational modeling Wireless sensor networks probabilistic routing distributed routing

来源：评论

学校读者我要写书评

暂无评论

Ring routing: An Energy-Efficient routing Protocol for Wireless Sensor Networks with a Mobile Sink

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2015年第9期14卷 1947-1960页

作者： Tunca, Can Isik, Sinan Donmez, Mehmet Yunus Ersoy, Cem Bogazici Univ Dept Comp Engn NETLAB Comp Networks Res Lab TR-34342 Istanbul Turkey Bogazici Univ Dept Math TR-34342 Bebek Turkey Bogazici Univ Dept Comp Engn Comp Networks Res Lab NETLAB TR-34342 Bebek Turkey NETAS AS Istanbul Turkey

In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring routing via extensive simulations.

关键词： Mobile sinks distributed routing data dissemination energy efficiency mobility wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

UNIDIRECTIONAL STAR GRAPHS

引用

INFORMATION PROCESSING LETTERS 1993年第3期45卷 123-129页

作者： DAY, K TRIPATHI, A UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455

We propose an assignment of directions to the edges of the n-star graph and derive attractive properties for the resulting unidirectional star graph US(n). A simple polarity function is used to define the directions of the edges. US(n) is shown to be strongly connected and recursively structured. The number of incoming ports of a node in US(n) is equal to the number of its outgoing ports (plus or minus one when n is even). The polarities of the ports of a neighboring node can be directly obtained from the polarities of the ports of the local node. These properties have allowed the design of a near optimal distributed routing algorithm as indicated by simulation results on all US(n) graphs with up to 362,880 nodes.

关键词： COMBINATORIAL PROBLEMS distributed COMPUTING DIRECTED GRAPHS distributed routing INTERCONNECTION NETWORKS STAR GRAPHS

来源：评论

学校读者我要写书评

暂无评论

Route selection for interference minimization to primary users in cognitive radio ad hoc networks: A cross layer approach

引用

PHYSICAL COMMUNICATION 2016年第Jun.期19卷 118-132页

作者： Basak, Surajit Acharya, Tamaghna IIEST Shibpur Dept Elect & Telecommun Engn Howrah 711103 India

An opportunistic routing problem in a cognitive radio ad hoc network is investigated with an aim to minimize the interference to primary users (PUs) and under the constraint of a minimum end-to-end data rate for secondary users (SUs). Both amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques are considered for message forwarding by SU nodes in the network. Unlike popular transmit power control based solutions for interference management in cognitive radio networks, we adopt a cross layer approach. The optimization problem is formulated as a joint power control, channel assignment and route selection problem. Next, closed form expression for transmission power is derived and corresponding channel selection scheme and routing metric are designed based on this solution. The proposed route selection schemes are shown to depend not only on gains of the interference channels between SUs and PUs but also on the values of the spectrum sensing parameters at the SU nodes in the network. Two distributed routing schemes are proposed based on our analysis;(i) optimal_DF and (ii) suboptimal_AF. The routing schemes could be implemented using existing table driven as well as on demand routing protocols. Extensive simulation results are provided to evaluate performance of our proposed schemes in random multihop networks. Results show significant reduction in PUs' average interference experience and impressive performance as opportunistic routing schemes can be achieved by our schemes compared to traditional shortest path based routing schemes. Performance improvement is also reported over prominent recent schemes. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Cognitive radio ad hoc networks Interference minimization Cross layer approach distributed routing QoS

来源：评论

学校读者我要写书评

暂无评论

Increased network routing efficiency through coordinated Fibbing

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2018年第11期31卷 e3588-e3588页

作者： Zhang, Weifan Zhang, Dong Zhu, Danhong Fuzhou Univ Coll Math & Comp Sci Fuzhou Fujian Peoples R China

For finding the best route in a network, distributed routing offers robustness but has poor flexibility while central control of software-defined networking is just the opposite. The Fibbing architecture can run distributed routing protocols on software-defined networking and has both robustness and flexibility. The 2 main steps of Fibbing's process are (1) compute a route that is available for the network according to the network topology and the flow request and (2) add fake nodes and fake links to augment the network topology in conformity with the distributed routing protocol and the route computed in the first step. Both of the 2 steps affect the performance of the network, but Fibbing does not consider them coordinately, and the cost of choosing the routes can be reduced further. In this paper, a coordinated algorithm for Fibbing is proposed to determine a lowest-cost route. In the process to calculate an available route, our algorithm accommodates not only the network topology and the flow request but also the fake nodes and the fake links. The experiments on random topologies and classic topologies show that our algorithm can reduce the numbers of the fake nodes and the costs of the chosen routes, with the improved flow request acceptance ratios achieved.

关键词： central control coordinated distributed routing Fibbing software-defined networking

来源：评论

学校读者我要写书评

暂无评论

Ultrafast potential-backup-cost (PBC)-Based shared path protection schemes

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2007年第8期25卷 2251-2259页

作者： Xu, Dahai Qiao, Chunming Xiong, Yizhi Princeton Univ Dept Elect Engn Princeton NJ 08544 USA SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA

This paper describes a novel ultrafast heuristic algorithm to address an NP-hard optimization problem. One of the significant and nonintuitive results is that the schemes based on the heuristic can achieve a better overall performance than their time-consuming integer-linear-programming-based counterparts. More specifically, the proposed schemes are useful in providing an online shared path protection by establishing survivable connections in high-speed networks. The advantage of our heuristic algorithm over the existing heuristic algorithms in finding a pair of link-disjoint paths, which are called active and backup paths, comes from the following salient feature. It uses a so-called potential- backup-cost (PBC) function when selecting an active path in the first phase to take into consideration the backup bandwidth needed by the corresponding backup path, which has yet to be chosen in the second phase. The PBC function is derived mathematically based on the statistical analysis of experimental data. While the use of PBC only requires partial aggregate information on how the existing connections are established in a network, it can also be applied even more effectively when complete information is available.

关键词： Bandwidth sharing distributed routing online heuristic potential cost statistical analysis

来源：评论

学校读者我要写书评

暂无评论

Trading Optimality for Scalability in Large-Scale Opportunistic routing

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2013年第5期62卷 2253-2263页

作者： Li, Yanhua Mohaisen, Abedelaziz Zhang, Zhi-Li Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Verisign Labs Reston VA 20190 USA

Opportunistic routing utilizes the broadcast nature of wireless networks, significantly promoting the unicast throughput. Many variations of opportunistic routing designs have been proposed, although all of the current designs consistently rely on all of the topology information to construct forwarder lists and process data forwarding, which indeed restricts the application in large-scale wireless networks, where collecting global optimal information is very costly. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS-B) algorithm to partition the topology into several nested close-node-sets (CNSs) using local information. LOR can locally realize the optimal opportunistic routing for a large-scale wireless network with low control overhead cost. Since it does not use global topology information, LOR highlights an interesting tradeoff between the global optimality of the used forwarder lists and scalability inferred from the incurred overhead. Extensive simulation results show that LOR dramatically improves performances over extremely opportunistic routing (ExOR) and MAC-independent opportunistic routing protocol (MORE), which are two well-known designs from the literature, in terms of control overhead, end-to-end delay, and throughputs. It also exhibits promising performance in vehicular ad hoc networks (VANETs).

关键词： distributed routing graph partitioning local information opportunistic routing

来源：评论

学校读者我要写书评

暂无评论

A new distributed route selection approach for channel establishment in real-time networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1999年第5期7卷 698-709页

作者： Manimaran, G Rahul, HS Murthy, CSR Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India

In this paper, we propose a new distributed route selection approach, called parallel probing, for real-time channel establishment in a point-to-point network. The existing distributed routing algorithms fall into two major categories: preferred neighbor based or flooding bared. The preferred-neighbor approach offers a better call acceptance rate, whereas the flooding approach is better in terms of call setup time and routing distance. The proposed approach attempts to combine the benefits of both preferred neighbor and flooding approaches in a way to improve all the three performance metrics simultaneously, This is achieved by probing k different paths in parallel, for a channel, by employing different heuristics on each path. Also, the proposed approach uses a notion called intermediate destinations (ID's), which are subset of nodes along the least-cost path between source and destination of a call, in order to reduce the excessive resource reservations while probing for a channel by releasing unused resources between ID's and initiating parallel probes at every ID. Further, it has the flexibility of adapting to different load conditions by its nature of using different heuristics in parallel, and hence, a path found for a channel would have different segments (a segment is a path between two successive ID's), and each of these segments would very well be selected by different heuristics, The effectiveness of the proposed approach has been studied through simulation for well-known network topologies for a wide range of quality-of-service and traffic parameters, The simulation results reveal that the average call acceptance rate offered by the proposed route-selection approach is better than that of both the flooding and preferred neighbor approaches, and the average call setup time and routing distance offered by it are very close to that of the flooding approach.

关键词： channel establishment distributed routing heuristics quality of service real-time networks

来源：评论

学校读者我要写书评

暂无评论

A HIERARCHICAL routing AND FLOW-CONTROL POLICY (HRFC) FOR PACKET SWITCHED NETWORKS

引用

IEEE TRANSACTIONS ON COMPUTERS 1980年第11期29卷 971-977页

作者： CHU, WW SHEN, MYC BELL TEL LABS INC NAPERVILLEIL 60540

A new policy that can effectively handle message routing and flow control simultaneously in a packet switched computer network is presented. In such a policy, a traffic threshold level is assigned for each channel in the network. If all the channels along the preassigned primary route from current node to its destination do not exceed the predetermined traffic threshold, then the primary route is used. Otherwise, alternative route(s) are used to share the traffic load. When all the alternative routes from a source to a destination become unavailable, then the input traffic from that source to that destination is temporarily rejected. Simulation results of the behavior and performance of such a routing and flow control policy are presented. The implementation of the policy is also discussed. Simulation results reveal that this new policy is simpler to implement and yields better performance than that of distributed routing algorithm and buffer allocation flow control policy, which are currently being used in many packet switched networks.

关键词： Alternative route HRFC computer network distributed routing flow control hierarchical routing and flow control policy packet switched network primary route routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：