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

Hierarchical Area-Based Address Autoconfiguration protocol for Self-organized Networks 7th

7th International Conference on Ad Hoc Networks

作者： Rakotondravelona, Mandimby N. Ranaivo Harivelo, Fanilo Anelli, Pascal Univ Reunion Isl LIM St Denis France

ISBN: (纸本)9783319250670;9783319250663

Node autoconfiguration is one of the main issues in selforganized networks. One class of approaches relies on hierarchical organization of nodes. This kind of structuration aims to deal with scalability issues, especially for wireless networks. But building and maintaining a hierarchy is generally expensive for these resource-limited networks. We propose a low-cost distributed, hierarchical, location-based address autoconfiguration protocol. Each node infers its address from those of its one-hop neighbors and from its relative position to them. In this way we obtain a globally-consistent organization resulting from local interactions only. This reduces the latency and the overhead generated during address configuration. Moreover this scheme is the first step towards the design of a scalable routing protocol taking advantages of the proposed hierarchical addressing.

关键词： self-organized ad-hoc wireless distributed protocol address autoconfiguration

来源：评论

学校读者我要写书评

暂无评论

Terminating distributed Construction of Shapes and Patterns in a Fair Solution of Automata 15

Terminating Distributed Construction of Shapes and Patterns ...

引用

34th Annual ACM Symposium on Principles of distributed Computing (PODC)

作者： Michail, Othon Comp Technol Inst & Press Diophantus CTI Patras Greece

ISBN: (纸本)9781450336178

In this work, we consider a solution of automata similar to Population protocols and Network Constructors. The automata, also called nodes, move passively in a well-mixed solution and can cooperate by interacting in pairs. During every such interaction, the nodes, apart from updating their states, may also choose to connect to each other in order to start forming some required structure. The model introduced here is a more applied version of Network Constructors, imposing geometrical constraints on the permissible connections. Each node can connect to other nodes only via a very limited number of local ports, which implies that at any given time it has only a bounded number of neighbors. Connections are always made at unit distance and are perpendicular to connections of neighboring ports. Though this variation can no longer form abstract networks, it is still capable of forming very practical 2D or 3D shapes. We develop new techniques for determining the computational and constructive capabilities of our model. One of the main novelties, concerns our attempt to overcome the inherent inability of such systems to terminate. In particular, exploiting the assumptions that the system is well-mixed and has a unique leader, we give terminating protocols that are correct with high probability (w.h.p.). This allows us to develop terminating subroutines that can be sequentially composed to form larger modular protocols. One of our main results is a terminating protocol counting the size n of the system w.h.p.. We then use this protocol as a subroutine in order to develop our universal constructors, establishing that it is possible for the nodes to self-organize w.h.p. into arbitrarily complex shapes and additionally always terminate

关键词： network construction programmable matter shape formation population distributed protocol interacting automata fairness random schedule self-organization

来源：评论

学校读者我要写书评

暂无评论

SREE-Tree: Self-Reorganizing Energy-Efficient Tree Topology Management in Sensor Networks 4

SREE-Tree: Self-Reorganizing Energy-Efficient Tree Topology ...

引用

2015 Sustainable Internet and ICT for Sustainability (SustainIT)

作者： De, Debraj Das, Sajal K. Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA

ISBN: (纸本)9781479973972

The evolving applications of Information and Communications Technologies (ICT), such as smart cities, often need sustainable data collection networks. We envision the deployment of heterogeneous sensor networks that will allow dynamic selfreorganization of data collection topology, thus coping with unpredictable network dynamics and node addition/deletion for changing application needs. However, the self-reorganization must also assure network energy efficiency and load balancing, without affecting ongoing data collection. Most of the existing literature either aim at minimizing the maximum load on a sensor node (hence maximizing network lifetime), or attempt to balance the overall load distribution on the nodes. In this work we propose to design a distributed protocol for self-organizing energy-efficient tree management, called SREE-Tree. Based on the dynamic choice of a design parameter, the in-network selfreorganization of data collection topology can achieve higher network lifetime, yet balancing the loads. In SREE-Tree, starting with an arbitrary tree the nodes periodically apply localized and distributed routines to collaboratively reduce load on the multiple bottleneck nodes (that are likely to deplete energy sooner due to a large amount of carried data flow or low energy availability). The problem of constructing and maintaining optimal data collection tree (T-opt) topology that maximizes the network lifetime (L(T-opt)) is an NP-Complete problem. We prove that a sensor network running the proposed SREE-Tree protocol is guaranteed to converge to a tree topology (T) with sub-optimal network lifetime (L (T)) such that 1/L(T) - 1/L(T-opt) < (is an element of + Q), where is an element of is the flexible design parameter and Q is a factor that can depend on system configuration. With the help of experiments using standard TinyOS based sensor network simulator TOSSIM, we have validated that SREE-Tree achieves better performance as compared to state-of-the-art solut

关键词： Sensor networks Data Collection Methods maximum loads Tree Topology design parameter Energy efficiency Information and communication technology Nondeterministic polynomial-time hard LOAD distributed protocol Ganglia data flow Tree management Network Load balancing

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-satisfied relay-selection scheme for wireless multicast networks with cooperative communications

Bandwidth-satisfied relay-selection scheme for wireless mult...

引用

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

作者： Yi Chen Ge Gao Shengbin Liao Huaxiong Yao School of Computer Science Huazhong Normal University Wuhan China School of Computer Science Wuhan University China National Engineering Research Center Huazhong Normal University Wuhan China

ISBN: (纸本)9781510821279

Cooperative communication is an efficient technology to achieve high bandwidth demands and wide error-prone client coverage. However, the previous cooperative multicast protocols suffer from bandwidth-violation problem while selecting relay nodes, namely, the cooperative hidden route problem (CHRP) by distributed protocols in wireless multicast networks. In this paper, a novel relay selection algorithm that can avoid the CHRP is proposed, and a bandwidth-satisfied multicast cooperative relay selection scheme is constructed. Moreover, to optimize the cooperative performance, we provide theory analysis for selecting a relay. Simulations results show that the proposed algorithm can efficiently mitigate multicast transmission errors and improve network throughput in a distributed wireless environment by more than 10%.

关键词： Cooperative Communications Multicast Relay-Selection Wireless Networks Multicast cooperative communication Wireless networks CYHR1 gene distributed protocol relay Multicast protocols selection algorithm wireless Network throughput

来源：评论

学校读者我要写书评

暂无评论

distributed switch and stay combining with partial relay selection and signal space diversity

引用

IET COMMUNICATIONS 2014年第1期8卷 105-113页

作者： Paruk, Zaid Xu, Hongjun Univ KwaZulu Natal Sch Engn ZA-4041 Durban South Africa

Spatial diversity schemes are often used to extract additional performance from wireless communication systems. Incorporating the partial relay selection (PRS) protocol into a distributed switch-and-stay combining (DSSC) cooperative communication network gives the benefit of diversity while simplifying hardware, processing and feedback requirements. Because only a single relay is ever active, the destination employs no combiner; the best relay is chosen based on first-hop relay conditions. However, achieved performance is worse than other distributed protocols, such as distributed selection combining (DSC). In this study, signal space diversity (SSD) is added to the DSSC–PRS system to provide further diversity and error performance gains, at the expense of necessitating a maximum-likelihood detector with increased complexity at the receiver. Analytical results are presented in the form of a lower bound based on the minimum distance lower bound for SSD systems and are verified with simulation. The DSSC–PRS–SSD system shows an improvement of 5 dB at a symbol error rate of 10 − 4 as well as a clear diversity order improvement. Spectral efficiency of the new system with SSD is slightly decreased at low signal-to-noise ratios, but is still an improvement over other distributed schemes, such as DSC.

关键词： diversity reception feedback maximum likelihood detection protocols radio networks radio receivers switching networks cooperative communication relay networks (telecommunication) wireless communication system PRS protocol partial relay selection protocol distributed switch-and-stay combining DSSC cooperative communication network feedback requirement flrst-hop relay condition distributed protocol distributed selection combining DSC SSD signal space diversity spatial diversity scheme maximum-likelihood detector radio receiver minimum distance lower bound symbol error rate diversity order improvement signal-to-noise ratio gain 5 dB

来源：评论

学校读者我要写书评

暂无评论

Robust Topology Control in Multi-Hop Cognitive Radio Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2014年第11期13卷 2634-2647页

作者： Zhao, Jing Cao, Guohong Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During spectrum switching, network partitions may occur since multiple links may be affected if they use the channel reclaimed by the primary users. In this paper, we address this problem through robust topology control, where channels are assigned to minimize channel interference while maintaining network connectivity when primary users appear. The problem is proved to be NP-hard and a sufficient condition for a robust channel assignment is derived. To solve this problem, we first propose centralized algorithms which can reduce the channel interference while satisfying the robustness constraints. Moreover, we derive its performance bound on channel interference and its computational overhead through theoretical analysis. Then, we propose distributed algorithms based on channel hopping techniques, and prove their correctness. Simulation results show that our solutions outperform existing interference-aware approaches substantially when primary users appear and achieve similar performance at other times.

关键词： Cognitive radio networks robustness channel assignment distributed protocol

来源：评论

学校读者我要写书评

暂无评论

Robust node-disjoint multipath routing for wireless sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2014年第2期15卷 112-120页

作者： Yu, Leilei Chen, Dongyan Huang, Xu Shandong Univ Sch Control Sci & Engn Jinan 250061 Peoples R China

In wireless sensor networks (WSNs), disjoint multipath routing has gotten immense research interest due to its capability of providing high reliability and load balancing. In this paper, we present a robust node-disjoint multipath routing (RNMR) protocol for WSNs. The protocol first constructs a multi-routing tree which has a number of node-joint but link-disjoint subtrees, and then finds multiple paths along these subtrees. Furthermore, by taking advantage of the structural characteristics inherent in the multi-routing tree, we present a customised redundancy scheme to improve the reliability of data transmission. The scheme provides individualised data redundancy for each sensor node. The protocol does not need to employ any control beacons in the data routing phase. Theoretical analysis and simulation results show that our protocol achieves higher reliability, reduces end-to-end delay and improves energy efficiency compared with existing approaches.

关键词： multipath routing node-disjoint reliability distributed protocol customised redundancy WSNs wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Leader-following coordination problem with an uncertain leader in a multi-agent system

引用

IET CONTROL THEORY AND APPLICATIONS 2014年第10期8卷 773-781页

作者： Tang, Yutao Chinese Acad Sci Inst Syst Sci Acad Math & Syst Sci Beijing Peoples R China

A leader-following coordination problem is considered in this study where the active leader is driven by an unknown input. With the help of output regulation and disturbance decoupling, a distributed protocol is proposed to solve this problem. Two cases are studied based on whether the bound of uncertain (disturbance) inputs of the leader is known. When the bound is unknown, an adaptive technique is employed to achieve the goal. Simulations are also given to verify the effectiveness of these controllers.

关键词： Uncertainty Plant uncertain Controllers distributed protocol Dyscoordination Output Regulation

来源：评论

学校读者我要写书评

暂无评论

A channel-access protocol to utilize multiple heterogeneous channels for ad hoc networks

引用

AD HOC NETWORKS 2014年第PartB期13卷 245-255页

作者： Jackson, Crystal A. Russell, Harlan B. Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA

We introduce a new approach to channel access for ad hoc networks that utilize multiple heterogeneous channels. The radios of the ad hoc networks we investigate are frequency-agile allowing them the ability to change their carrier frequency and transmission rate over a wide range of possibilities. Our approach to channel access takes advantage of the multiple frequency bands available to the network to increase network-layer performance. We have previously found that in some network scenarios, the best network-layer performance is achieved if the channel-access protocol always selects the channel with the fastest data rate that is immediately available. However, in other network scenarios it is preferable to always wait for a channel with a faster data rate that is temporarily unavailable to become available rather than select a channel with a slower data rate that is immediately available. We show that our new channel-access protocol is able to adapt the strategy for selecting channels so that high network-layer performance is maintained in all scenarios compared to channel-access protocols that utilize either fixed strategy. (C) 2013 Elsevier B.V. All rights reserved.

关键词： distributed protocol Ad hoc network Multichannel MAC Heterogeneous channels

来源：评论

学校读者我要写书评

暂无评论

Simple and Efficient Local Codes for distributed Stable Network Construction 14

Simple and Efficient Local Codes for Distributed Stable Netw...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Michail, Othon Spirakis, Paul G. Comp Technol Inst & Press Diophantus CTI Patras Greece Univ Liverpool Dept Comp Sci Liverpool Merseyside England CTI Patras Greece

ISBN: (纸本)9781450329446

In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects. In particular, we assume finite-state processes that all begin from the same initial state and all execute the same protocol. Moreover, we assume pairwise interactions between the processes that are scheduled by a fair adversary. In order to allow processes to construct networks, we let them activate and deactivate their pairwise connections. When two processes interact, the protocol takes as input the states of the processes and the state of their connection and updates all of them. Initially all connections are inactive and the goal is for the processes, after interacting and activating/deactivating connections for a while, to end up with a desired stable network. We give protocols (optimal in some cases) and lower bounds for several basic network construction problems such as spanning line, spanning ring, spanning star, and regular network. The expected time to convergence of our protocols is analyzed under a uniform random scheduler. Finally, we prove several universality results by presenting generic protocols that are capable of simulating a Turing Machine (TM) and exploiting it in order to construct a large class of networks. We additionally show how to partition the population into k supernodes, each being a line of log k nodes, for the largest such k. This amount of local memory is sufficient for the supernodes to obtain unique names and exploit their names and their memory to realize nontrivial constructions.

关键词： network construction distributed protocol interacting automata stabilization population fairness random schedule structure formation self-organization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：