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

70th IEEE Vehicular Technology Conference

作者： Scopigno, Riccardo Cozzetti, Hector Agustin Ist Super Mario Boella I-10129 Turin Italy

ISBN: (纸本)9781424425143

Vanet literature is mainly focused on CSMA and CSMA-like access protocols. Actually a deep study on how a slotted approach could be adopted in Vanet is missing. This is mainly due to the lack of a distributed MAC able to guarantee a scalable resource reservation without involving a central poller. In this paper we propose a novel protocol, MS-Aloha, which is based on recent RR-Aloha extensions, in order to overcome its most critical limitations. The protocol is studied theoretically and validated by simulations. Even if an extensive analysis is far from being achieved, some relevant results are discussed as important enabling steps.

关键词： Vanet Slotted-ALOHA distributed protocol Resource Optimisation Collision Avoidance

来源：评论

学校读者我要写书评

暂无评论

Mobile node deployment in hybrid sensor networks

Mobile node deployment in hybrid sensor networks

引用

2nd International Conference on Communications and Networking in China

作者： Wang, Shupeng Yang, Mei Wang, Jianping Jiang, Yingtao Jo, Ju-Yeon Chinese Acad Inst Comp Technol Ctr Informat Intelligence & Secur Beijing Peoples R China Univ Nevada Dept Elect & Comp Engn Las Vegas NV USA City Univ Hong Kong Dept Comp Sci Kowloon Peoples R China Univ Nevada Sch Informat Las Vegas NV USA

ISBN: (纸本)9781424410088

Hybrid sensor networks consisting of both static and mobile sensor nodes attract more research interests with their enhanced capability. As mobile nodes generally have more power than static nodes, they are preferable to be used as cluster heads. In this paper, we study the mobile node deployment problem with the objective of maximizing the number of static nodes covered by the mobile nodes with minimized moving distance. We prove that this problem is NP-complete and propose a distributed deployment protocol to solve it. In the proposed protocol, different policies of selecting the moving nodes are considered to cover more static nodes with less moving distance. Simulation results show that the proposed protocol achieves high coverage ratio with acceptable moving distance.

关键词： wireless sensor networks deployment NP-complete distributed protocol

来源：评论

学校读者我要写书评

暂无评论

Deterministic secure positioning in wireless sensor networks 1

引用

4th IEEE International Conference on distributed Computing in Sensor Systems

作者： Delaet, Sylvie Mandal, Partha Sarathi Rokicki, Mariusz A. Tixeuil, Sebastien Univ Paris 11 LRI UMR 8623 Paris France Indian Inst Technol Kanpur 208016 Uttar Pradesh India CNRS F-75700 Paris France Univ Paris 06 UMR 7606 F-75252 Paris 05 France INRIA Paris France

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

Position verification problem is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location information in order to fake their actual position. In this paper we propose the first deterministic distributed protocol for accurate identification of faking sensors in a WSN. Our scheme does not rely on a subset of trusted nodes that cooperate and are not allowed to misbehave. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most [n/2] - 2 faking sensors. When the time of flight (ToF) technique is used, our protocol manages at most [n/2] - 3 misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is [n/2] - 1. Thus, our scheme is almost optimal with respect to the number of faking sensors. We discuss application of our technique in the trusted sensor model. More specifically, our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones.

关键词： wireless sensor network secure positioning distributed protocol

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

引用

JOURNAL OF SUPERCOMPUTING 2010年第1期53卷 182-195页

作者： Xu, Zhenyu Wang, James Srimani, Pradip K. Clemson Univ Sch Comp Clemson SC 29634 USA

Our purpose in this paper is to propose a self-stabilizing protocol for weakly connected dominating set (WCDS) set in a given ad hoc network graph. WCDS is a particular variant of graph domination predicates which play an important role in routing in ad hoc networks. There are many variants of domination problems in bidirectional networks;WCDS is also useful in forming clusters in ad hoc networks. There are many heuristic and distributed algorithms to compute WCDS in network graphs while almost all of them will need complete information about the network topology and most of them are not fault tolerant or mobility tolerant. Self-stabilization is a protocol design paradigm that is especially useful in resource constrained infrastructure-less networks since nodes can make moves based on local knowledge only and yet a global task is accomplished in a fault tolerant manner;it also facilitates for nodes to enter and exit the network freely. There exist self-stabilizing protocols for minimal spanning tree, total domination, and others. We have shown that the paradigm is capable of designing a protocol for WCDS. Our objective is to mathematically prove the correctness and the convergence of the protocol in any worst-case scenario, as is usually done for self-stabilizing protocols for other graph predicates used for ad hoc networks.

关键词： distributed protocol Fault tolerance Ad hoc network Weakly connected dominating set

来源：评论

学校读者我要写书评

暂无评论

HEAT: Scalable routing in wireless mesh networks using temperature fields

HEAT: Scalable routing in wireless mesh networks using tempe...

引用

IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks

作者： Baumann, Rainer Heimlicher, Simon Lenders, Vincent May, Martin ETH Comp Engn & Networks Lab Zurich Switzerland Princeton Univ Dept Elect Engn Princeton NJ USA

ISBN: (纸本)9781424409921

Existing unicast routing protocols are not suited well for wireless mesh networks as in such networks, most traffic flows between a large number of mobile nodes and a few access points with Internet connectivity. In this paper, we propose HEAT, an anycast routing protocol for this type of communication that is designed to scale to the network size and to be robust to node mobility. HEAT relies on a temperature field to route data packets towards the Internet gateways, as follows. Every node is assigned a temperature value, and packets are routed along increasing temperature values until they reach any of the Internet gateways, which are modeled as heat sources. Our major contribution is a distributed protocol to establish such temperature fields. The distinguishing feature of our protocol is that it does not require flooding of control messages. Rather, every node in the network determines its temperature considering only the temperature of its direct neighbors, which renders our protocol particularly scalable to the network size. We analyze our approach and compare its performance with OLSR through simulations with Glomosim. We use realistic mobility patterns extracted from geographical data of large Swiss cities. Our results clearly show the benefit of HEAT versus OLSR in terms of scalability to the number of nodes and robustness to node mobility. The packet delivery ratio with HEAT is more than two times higher than OLSR in large mobile scenarios and we conclude that HEAT is a suitable routing protocol for city-wide wireless mesh networks.

关键词： heat Internet Gateway Wireless mesh networks Temperature fields Scalability Routing protocols distributed protocol control message Packet Geographical data data packets

来源：评论

学校读者我要写书评

暂无评论

Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings

Service time optimal self-stabilizing token circulation prot...

引用

21st IEEE Symposium on Reliable distributed Systems

作者： Johnen, C Univ Paris 11 CNRS LRI F-91405 Orsay France

ISBN: (纸本)0769516599

We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). All previous randomized self-stabilizing token circulation protocols design to work under unfair distributed schedulers have the same drawback: once stabilized, the service time is slow (in the best case, it is bounded by 2N where N is the ring size). Once stabilized, our protocol provides an optimal service: after :V computation steps, each processor has obtained one time the token. The protocol can be used to implement a fair distributed mutual exclusion in any ring topology network.

关键词： distributed protocol fault-tolerant mutual exclusion self-stabilization anonymous ring token circulation unfair scheduler service time.

来源：评论

学校读者我要写书评

暂无评论

Tightening Up the Incentive Ratio for Resource Sharing Over the Rings 34

Tightening Up the Incentive Ratio for Resource Sharing Over ...

引用

34th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Cheng, Yukun Deng, Xiaotie Li, Yuhao Suzhou Univ Sci & Technol Sch Business Suzhou Key Lab Big Data & Informat Serv Suzhou Peoples R China Peking Univ Ctr Frontier Comp Studies Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781728168760

Fundamental issues in resource sharing over large scale networks have gained much attention from the research community, in response to the growth of sharing economy over the Internet and mobile networks. We are particularly interested in the fundamental file sharing and subsequently P2P network bandwidth sharing developed by BitTorrent and later formalized by Wu and Zhang [15] as the proportional response protocol. It is of practical importance in the design to provide agent incentives to follow the distributed protocol out of their own rationality. We study the robustness of the distributed protocol in this incentive issue against a Sybil attack, a common type of grave threat in P2P network. For the resource sharing on rings, and we characterize the utility gain from a Sybil attack in the concept of incentive ratio. Previous works proved the incentive ratio is lower bounded by two and upper bounded by four, and later the upper bound is improved to three. It has been listed in [5] and [9] as an open problem to tighten them. In this paper, we completely resolve this open problem with a better understanding on the influence from different class agents to the resource allocation under the distributed protocol.

关键词： Resource sharing Proportional response dynamics Incentive ratio Sybil attack distributed protocol

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

M-Backs: Mobile Backbones for Multi-hop Wireless Networks

M-Backs: Mobile Backbones for Multi-hop Wireless Networks

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Nanni, Maurizio A. Basagni, Stefano Northeastern Univ ECE Dept Boston MA 02115 USA

ISBN: (纸本)9781612842547

We present a new distributed protocol for setting up and maintaining a backbone for multi-hop mobile networks. Our solution, termed M-Backs, is effective in producing backbones with limited size, while being robust and reliable in the face of node mobility. We compare our protocol with previous solutions for mobile backbone set up and maintenance. M-Backs outperforms previous protocols, providing backbones of reasonable size, with superior connectivity, shorter route lengths, higher robustness and lower maintenance-related overhead. When running AODV over the backbones M-Backs obtains higher packet delivery ratio and lower latency than previous backbone protocols and than AODV run over the flat network topology.

关键词： AODV M-backs Mobile communication Mobile computing Network topology Peer to peer computing Robustness Routing protocols backbone protocols distributed protocol flat network topology mobile backbones mobile communication multihop mobile networks multihop wireless networks node mobility protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：