2009 Sixth International Conference on Wireless On-Demand Network Systems and Services最新文献

Generative dynamic deployment of multiple components in wireless sensor networks 无线传感器网络中多组件的生成式动态部署

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801838

S. Suenaga, Nobukazu Yoshioka, S. Honiden

{"title":"Generative dynamic deployment of multiple components in wireless sensor networks","authors":"S. Suenaga, Nobukazu Yoshioka, S. Honiden","doi":"10.1109/WONS.2009.4801838","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801838","url":null,"abstract":"Wireless sensor networks (WSN) consist of spatially distributed nodes that monitor physical conditions. In the past, most WSNs have been designed with a single specific application in mind. Recent developments however are expanding the applicability of WSNs and are increasing the demand for deploying multiple applications simultaneously. To host multiple applications in a single WSN, current solutions provide mechanisms for components to be dynamically deployed to nodes. However, two issues make the present form of dynamic deployment impractical for applications involving distributed collaboration and the redeployment of multiple distributed components. For one, existing works lack a suitable architecture for cooperation and interaction between components in WSNs. Another problematic aspect is the insufficiency of current methods in efficiently deploying multiple components throughout the network. To address these issues, we propose an architecture based on multiple components that have specific responsibilities in regard to deployment and a generative approach for dynamic deployment of such components.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128405476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

gMAP: Efficient construction of global maps for mobility-assisted wireless sensor networks gMAP:高效构建移动辅助无线传感器网络的全球地图

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801837

Abdelmajid Khelil, F. Shaikh, Azad Ali, N. Suri

引用次数: 19

Packet suppression protocol for a regional protection system using a wireless ad-hoc network 使用无线自组织网络的区域保护系统的包抑制协议

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801857

Y. Fuwa, H. Oda, Tomohiro Takeda, K. Fuwa, Masashi Miyagi, Masaaki Niimura, H. Kunimune, Eiki Motoyama

{"title":"Packet suppression protocol for a regional protection system using a wireless ad-hoc network","authors":"Y. Fuwa, H. Oda, Tomohiro Takeda, K. Fuwa, Masashi Miyagi, Masaaki Niimura, H. Kunimune, Eiki Motoyama","doi":"10.1109/WONS.2009.4801857","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801857","url":null,"abstract":"We are currently developing a Regional Protection System in which children have terminals, and transponders installed at various locations receive packets sent from these terminals via a Specified Low-Power Radio System. The packets are then transmitted to a server so the positions of the children can be inferred from that information. With the ARIB STD-T67 access protocol used in this system, collisions frequently occur at locations where there are many terminals. Therefore, the authors improved a protocol in which frequent collisions do not occur, even when as many as 150 terminals gather in the same place. However, it was impossible to prevent frequent collisions when many terminals are concentrated in one place, such as in a school. A new access protocol was developed in this research to deal with this problem. In this protocol, transmission by terminals is suppressed at specific locations, and then resumed after the terminal moves away from those locations. However, the position of a terminal must not be lost when its transmission is being restricted. In this presentation, we propose this new access protocol, and evaluate its effectiveness.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130075930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Node presence detection with reduced overhead 减少开销的节点存在检测

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801831

Thi-Minh-Dung Tran, B. Scheuermann, M. Mauve

引用次数: 3

TO-GO: TOpology-assist geo-opportunistic routing in urban vehicular grids TO-GO:城市车辆网格中的拓扑辅助地理机会路由

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801842

Kevin C. Lee, U. Lee, M. Gerla

引用次数: 79

LDoS attack in ad-hoc network ad-hoc网络中的ddos攻击

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801858

Yanxiang He, Yiran Han, Q. Cao, Tao Liu, Libing Wu

引用次数: 4

Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks 虚拟寻址在传感器网络中高效容错路由中的优势

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801850

Abdalkarim Awad, Lei Shi, R. German, F. Dressler

{"title":"Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks","authors":"Abdalkarim Awad, Lei Shi, R. German, F. Dressler","doi":"10.1109/WONS.2009.4801850","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801850","url":null,"abstract":"We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the Virtual Cord Protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. Distributed Hash Tables (DHTs) are used to associate data items in sensor networks with particular node addresses. The addresses of nodes are dynamically maintained by the protocol to form a virtual cord. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always points towards the destination. Furthermore, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the possible shortest path with very low overhead. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g. Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The results presented in this paper outline the capabilities of VCP to handle such cases.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Cluster-based inter-domain routing (cidr) protocol for MANETs 基于集群的域间路由(cidr)协议

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801843

Biao Zhou, Z. Cao, M. Gerla

{"title":"Cluster-based inter-domain routing (cidr) protocol for MANETs","authors":"Biao Zhou, Z. Cao, M. Gerla","doi":"10.1109/WONS.2009.4801843","DOIUrl":"https://doi.org/10.1109/WONS.2009.4801843","url":null,"abstract":"Nowadays, inter-domain routing for MANETs draws increasing attention because of military and vehicular applications. The challenges in wireless, mobile inter-domain routing include dynamic network topology, intermittent connectivity, and routing protocol heterogeneity. The existing Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol for the Internet. But BGP is not applicable to MANETs because the BGP design is based on a static Internet which does not support dynamic discovery of members, and cannot scale to mobile, dynamic topology environments. The proposed cluster-based inter-domain routing (CIDR) protocol obtains efficient communications among MANETs and achieves scalability in large networks by using the clustering technique. The proposed approach generates clusters using group affinity. In each domain, the distributed clustering algorithm discovers the set of “traveling companions” - these are the nodes that stick together as a group for some time or for some common tasks. It elects within each set a Cluster Head (CH) for each affinity group. Affinity is defined in terms of some common characteristics, such as group motion or task. The clusters (i.e., subnets) can be defined a priori or may evolve dynamically by the affinity of geography, motion, or task. The cluster head in the subnet acts as local DNS for own cluster and also (redundantly) for neighbor clusters. The cluster head advertises to neighbors and the rest of the network its connectivity, members, and domain information. The advertising protocol plays the role of BG Protocol. In the proposed protocol, packets to remote nodes are routed via cluster-head advertised routes, and packets to local destinations are routed using the local routing algorithm. The experiments have shown that the proposed inter-domain routing has achieved scalability and robustness to mobility.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 53

Decentralized link adaptation for multi-link MIMO interference system 多链路MIMO干扰系统的分散链路自适应

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801845

Mirza Tayyab Mehmood, Abdelwaheb Marzouki, D. Zeghlache

引用次数: 0

A distributed solution to estimation problems in wireless sensor networks leveraging broadcast communication 利用广播通信的无线传感器网络中估计问题的分布式解决方案

2009 Sixth International Conference on Wireless On-Demand Network Systems and Services Pub Date : 2009-02-02 DOI: 10.1109/WONS.2009.4801852

Simone Del Favero, F. Librino, F. Zorzi, Albert F. Harris III, M. Zorzi

引用次数: 1