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

Asia Communications and Photonics Conference (ACP)

作者： Song, Kangjing Zhang, Jie Zhao, Yongli Yu, Xiaosong Yu, Yiming Chen, Bowen Yang, Hui Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

We introduce a service-oriented spectrum assignment framework and propose two algorithms to solve the routing and Spectrum Assignment (RSA) in flexible bandwidth optical networks. Numerical simulations demonstrate low... 详细信息

ISBN: (纸本)9781467362740

关键词： algorithms Analytical techniques Assignment algorithms Numerical simulation Optical networks routing algorithms Fiber optics and optical communications (060.0060) Networks, assignment and routing algorithms (060.4251)

来源：评论

学校读者我要写书评

暂无评论

An Efficient Solution Offering Sink Mobility Support in Wireless Sensor Networks

An Efficient Solution Offering Sink Mobility Support in Wire...

引用

Symposium on Wireless Telecommunications

作者： Lino, Carlos Calafate, Carlos T. Diaz-Ramirez, Arnoldo Manzoni, Pietro Cano, Juan-Carlos Inst Tecnol Leon Leon 37000 Mexico

ISBN: (纸本)9781457705809

The wireless sensor networks (WSNs) application scope has widened in recent years. For instance, the IEEE 802.15.4 technology allows establishing a mesh sensor network to support applications that increase the security of physical spaces, such as intruder detection, gas detection, and fire detection. In this paper, we focus on applications which require the support for mobility, including intruder detection and pursuit scenarios. Communications are based on the IEEE 802.15.4 standard due to its low power consumption, low latency and the ability to connect a large number of sensor nodes in a WSN. We propose the novel Mobile-sink routing for Large Grids (MRLG) algorithm, which is intended to support sink mobility in a WSN. MRLG allows reducing the routing load by relying on local route recovery processes, which provides significant efficiency in scenarios with a large number of sensors. Experimental results show that, when compared to standard routing strategies based on sink announcements such as the Collection Tree Protocol (CTP), the performance of the MRLG algorithm is significantly boosted in terms of packet delivery ratio, end-to-end delay, and routing overhead.

关键词： wireless sensor networks IEEE 802.15.4 mobile-sink routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Mobile Agent routing Algorithm in Dual-Channel Wireless Sensor Network

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第unknown期2012卷 1-9页

作者： Liu, Kui Liu, Sanyang Feng, Hailin Xidian Univ Dept Appl Math Xian 710071 Peoples R China

A mobile agent routing algorithm (MARA) is presented in this paper, and then based on the dual-channel communication model, the two-layer network combination optimization strategy is also proposed. Since this strategy deals with the collision between packets and the multicast suppression in channel competitive process well, the blocking probability of network and the error rate of packet transmission can be cut down by utilizing this strategy. Furthermore, a restore rule for the failure optimal route is presented too. By using this rule, the optimal route can restore quickly in the local of fail nodes and most of the information of original optimal route can be reserved. Compared with other existing algorithms like ant colony optimization-based dynamic energy-efficient mobile agent routing algorithm (ADEEMA) and mobile agent-based wireless sensor network (MAWSN), simulation results show that MARA performs better in improving the success rate of packet transmission and cutting down the delay of communication. The success rate of packet transmission is improved 15%. Simultaneously, this algorithm can keep the ant agents away from the nodes with less residual energy in searching for the optimal route. This way can make the energy of each nodes on the optimal route overall decline and hence improve the lifetime of network.

关键词： MOBILE agent systems routing algorithms WIRELESS sensor nodes INFORMATION storage & retrieval systems ENERGY consumption DATA packets & packeting

来源：评论

学校读者我要写书评

暂无评论

Packet Error Rate Optimization for routing algorithms in ad hoc wireless sensor networks

Packet Error Rate Optimization for Routing algorithms in ad ...

引用

16th Mediterranean Conference on Control and Automation

作者： Sabater, Jordi Lopez, Manel Gomez, Jose M. Herms, Atila Univ Barcelona Dept Elect E-08028 Barcelona Spain

ISBN: (纸本)9781424425044

Over the last years, wireless multihop ad hoc networks have received a tremendous interest from research groups. The major focal point has been the routing protocols, i.e. how to select the best route to send information from any source to any destination. Each node in an ad hoc network may work as a router to relay connections or data packets to their destination. The key issues of ad hoc networking are Medium Access Control, which is used to share common channel resources among wireless nodes, and the networking layer. In this work, we have implemented a routing protocol based on the multihop algorithm to transmit information from any source to any destination node. We have focused on an indoor wireless sensor network, where all the links between nodes follow a tine-of-sight propagation model. Medium Access Control and Physical layer have been implemented according to the IEEE 802.15.4 standard in the 2.45 GHz frequency band where information is modulated in O-QPSK. In multihop wireless networks, one important question is how does the route selection depend on the physical and logical topology of the network. In terms of routing there is a trade-off between between hop distance and reception rate. This compromise will give us the best route to minimize the power consumption and maximize the transmission success probability.

关键词： routing algorithms Wireless Sensor Networks IEEE 802.15.4 standard software algorithms

来源：评论

学校读者我要写书评

暂无评论

A Mesh-Connected Rings Topology for Network-on-Chip

A Mesh-Connected Rings Topology for Network-on-Chip

引用

13th International Conference on Parallel and Distributed Computing, Applications, and Technologies (PDCAT)

作者： Liu Youyao Han Jungang Xian Univ Posts & Telecommun Sch Elect Engn Xian Peoples R China

ISBN: (纸本)9780769548791

With the feature size of semiconductor technology reduced and (Intellectual Properties) IP cores increased, on chip interconnection network architectures have a great influence on the performance and area of System-on-Chip(SoC) design. Focusing on trade-off performance, cost and implementation, a regular Network-on-Chip ( NoC ) architecture, named Mesh-Connected Rings (MCR) interconnection network, is proposed. The topology of MCR is simple, planar and scalable in architecture, which combines Mesh with Ring. A detailed theoretical analysis for MCR and Mesh is given, and a simulation analysis based on the virtual channel router with wormhole switching is also presented. The results compared with the general Mesh architecture show that MCR has better performance, especially in local traffics and low loads, and lower cost.

关键词： System-on-Chip Network-on-Chip Network Topology routing algorithms Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Flooding Control by using Angle Based Cone for UWSNs

Flooding Control by using Angle Based Cone for UWSNs

引用

International Symposium on Telecommunication Technologies (ISTT)

作者： Ali, Tariq Jung, Low Tang Ameer, Sadia Univ Teknol Petronas CIS Dept Tronoh Malaysia Islamia Univ Dept Stat Bahawalpur Pakistan

ISBN: (纸本)9781467347860;9781467347846

Providing better communication in UWSNs and maximize the communication performance is challenging issue due to volatile characteristics of underwater environment. Radio signal cannot properly propagate in underwater, so there is need, such type of acoustic modem technology that can supports better data rates and reliable underwater wireless communications. Further, nodes mobility, 3-D spaces brings some critical challenges for the researcher to design new routing protocol for UWSNs, to handle the issues like high end to end delays, Propagation delay, as well as power constraints of the sensor nodes. Many routing algorithms have been proposed in last two decades and some of them provide better solution to handle such type of issues. In this paper, we proposed a novel routing protocol called Layer by layer Angle Based Flooding (L2-ABF.), to address the problem node swaying issue, end-to-end delays, and node energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packet to the next upper layer toward the surface sinks without using any explicit configuration and location information. The simulation results show that L2-ABF has some advantages over some existing flooding base techniques and can easily manage quick routing changes where node movements are frequent.

关键词： propagation delays routing algorithms UWSN volatile environment flooding angle

来源：评论

学校读者我要写书评

暂无评论

Spatial and Temporal Correlations-Based routing Algorithm in Intermittent Connectivity Human Social Network

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第3期8卷 1-8页

作者： Zhou Tao Xu Hongbin Liu Ming Liu Nianbo Gong Haigang Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Sch Automat Chengdu 611731 Peoples R China

The social network formed by people is one of the key applications of Delay-Tolerant Network (DTN). Owing to its intermittent connectivity and unique human mobility patterns, how to transmit data in an effective way is a challenging problem for the social network. In this paper, we propose the idea of Trip History Model (THM) which establishes a model on a single person's mobility, and then a Spatial and Temporal Correlations-Based routing Algorithm (STC) is proposed. In STC, the node delivery probability is calculated according to both a node's current moving prediction and its history record to give guidance for message transmission. Our simulation results show that, compared with LABEL and PROPHET algorithms, STC effectively improves the routing performance of the network.

关键词： routing algorithms SOCIAL network theory (Communication) NETWORK Time Protocol (Computer network protocol) PATTERN recognition systems DATA transmission systems NETWORK performance (Telecommunication)

来源：评论

学校读者我要写书评

暂无评论

Improvement for AODV based on Backup Path strategy

Improvement for AODV based on Backup Path strategy

引用

8th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Sun, Weizhen Zhang, Qinzhen Xiang, Yong Capital Normal Univ Coll Informat Engn Beijing 100048 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781612846835;9781612846828

Wireless links are often asymmetric due to the heterogeneity in transmission power of devices, the limitation of node energy, different antenna gain among nodes and non-uniform environmental noise. Nevertheless, most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional, such algorithms are not able to react to or exploit the full connectivity of the network. In this paper, an improvement for AODV based on Backup Path strategy (AODV-BP) is proposed, which computes routing path with backup routing table and Backtrack Route Reply mechanism when subjected to unidirectional links. Performance results using ns-2 simulations, under varying number of unidirectional links, show that AODV-BP performs well in scenarios where exist more unidirectional links when compared to basic AODV and AODV-Blacklist schemes.

关键词： MANET unidirectional links routing algorithms AODV

来源：评论

学校读者我要写书评

暂无评论

Delay tolerant network routing algorithm to enhance the packet forwarding direction

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2012年第4期35卷 6-10页

作者： Zhang, Wen-Zhu Han, Xiao-Dong State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 China

A new routing algorithm named spray and wait routing algorithm based on grey Markov prediction model (SWR-GM) for delay tolerant network (DTN) is proposed. It combines grey Markov location predicting model with the spray and wait routing algorithm depending on activity coefficient of a node (ACoN). It predicates the location of the destination node by utilizing grey markov location predicting model. It also introduces the concept of ACoN to quantify the strength of a node's activity. In addition, the algorithm sprays and forwards packets on the basis of ACoN, so it can enhance the transfer direction. Simulation shows that SWR-GM algorithm can provide better network performance compared with the Epidemic algorithm and the traditional spray and wait outing (SWR) algorithm.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm

Degree-Constrained Minimum Spanning Tree Problem Using Genet...

引用

4th World Congress on Nature and Biologically Inspired Computing (NaBIC)

作者： Liu, Keke Chen, Zhenxiang Abraham, Ajith Cao, Wenjie Jing, Shan Univ Jinan Shandong Prov Key Lab Network Based Intelligent C Jinan Peoples R China MRI Lab Auburn WA 98071 USA VSB Tech Univ Ostrava IT Innovat Ostrava Czech Republic

ISBN: (纸本)9781467347686

Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each node and discuss the problem of multicast in the case of degree-constraint, which has an important significance in the communication network. Limiting the capacity of each node during the replication process of information transmission can improve the speed of the network, which has an important significance in real-time service. In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution. At the same time, we improve the generating random tree and replace the variation by the combination of the two variations. On one hand, we improve the efficiency of generating random tree and on the other hand, we can control the mutation of different variations in a more flexible manner.

关键词： Multicast Replication-Associated Process Genetic Algorithm (GA) routing algorithms Line of nodes networks(communications) Steiner trees evolution schedule service data transmission Spanning tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：