发布求助
文献互助 智能选刊 最新文献

2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks最新文献

筛选
英文 中文
Versatile Model Architecture for Multi-channel MAC Simulation in NS2 NS2中多通道MAC仿真的通用模型体系结构
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.50
G. Wei, Dongmei Zhang
{"title":"Versatile Model Architecture for Multi-channel MAC Simulation in NS2","authors":"G. Wei, Dongmei Zhang","doi":"10.1109/MSN.2008.50","DOIUrl":"https://doi.org/10.1109/MSN.2008.50","url":null,"abstract":"Research on multi-channel MAC has been got much attention in wireless networks. Extensions of NS2 mobile node architecture (MNA) to support multi-channel MAC simulation are not adaptable to home gateway configurations. This paper proposes a versatile model architecture (VMA) to make simulation of home gateway available. Based on the previous works, VMA defines an entity of data link adaptor and is capable to cover the configurations of multiple MACs and multiple multi-channel MACs. The paper presents how to extend MNA to VMA and how to modify NS2 simulation software. Validations of VMA-based multi-channel throughputs are present and discussed.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132718936","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}
引用次数: 5
Hector is an Energy Efficient Tree-Based Optimized Routing Protocol for Wireless Networks Hector是一种基于树型优化的无线网络路由协议
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.24
N. Mitton, Tahiry Razafindralambo, D. Simplot-Ryl, I. Stojmenovic
{"title":"Hector is an Energy Efficient Tree-Based Optimized Routing Protocol for Wireless Networks","authors":"N. Mitton, Tahiry Razafindralambo, D. Simplot-Ryl, I. Stojmenovic","doi":"10.1109/MSN.2008.24","DOIUrl":"https://doi.org/10.1109/MSN.2008.24","url":null,"abstract":"This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with known distances between neighbors but unknown geographic locations. We propose Hector, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In our algorithm, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase tree coordinates. If such a node does not exist then forwarding is made to the neighbor that reduces tree based distance and optimizes power cost over tree distance progress ratio. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124459665","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
Hybrid Position-Based Routing Algorithms for 3D Mobile Ad Hoc Networks 三维移动自组网中基于位置的混合路由算法
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.43
Song Liu, T. Fevens, A. Abdallah
{"title":"Hybrid Position-Based Routing Algorithms for 3D Mobile Ad Hoc Networks","authors":"Song Liu, T. Fevens, A. Abdallah","doi":"10.1109/MSN.2008.43","DOIUrl":"https://doi.org/10.1109/MSN.2008.43","url":null,"abstract":"Numerous routing algorithms have been proposed for routing efficiently in mobile ad hoc networks (MANETs) embedded in two dimensional (2D) spaces. But, in practice, such networks are frequently arranged in three dimensional (3D) spaces where the assumptions made in two dimensions, such as the ability to extract a planar subgraph, break down. Recently, a new category of 3D position-based routing algorithms based on projecting the 3D MANET to a projection plane has been proposed. In particular, the adaptive least-squares projective (ALSP) face routing algorithm (Kao et al., 2007) achieves nearly guaranteed delivery but usually discovers excessively long routes to the destination. Referencing the idea of hybrid greedy-face-greedy (GFG) routing in 2D MANETs, we propose a local hybrid algorithm combining greedy routing with ALSP Face routing on projection planes. We show experimentally that this hybrid ALSP GFG routing algorithm on static 3D ad hoc networks can achieve nearly guaranteed delivery while discovering routes significantly closer in length to shortest paths. The mobility of nodes is handled by introducing the concepts of active sole nodes and a limited form of flooding called residual path finding to the ALSP GFG routing algorithm. Under mobility simulations, we demonstrate that the mobility-adapted hybrid routing algorithm can maintain high delivery rates with decreases in the average lengths of the paths discovered compared to shortest paths, without generating a large amount of flooding traffic.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129062469","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}
引用次数: 25
A Multi-channel and Power Controlled Based AODV for Throughput Improvement in Multi-hop Ad Hoc Networks 基于多通道和功率控制的AODV多跳自组织网络吞吐量改进
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.35
Carine Toham, François Jan, A. Duda
{"title":"A Multi-channel and Power Controlled Based AODV for Throughput Improvement in Multi-hop Ad Hoc Networks","authors":"Carine Toham, François Jan, A. Duda","doi":"10.1109/MSN.2008.35","DOIUrl":"https://doi.org/10.1109/MSN.2008.35","url":null,"abstract":"We propose a solution which aims at improving the throughput in multi-hop ad hoc networks. This solution equips nodes with multiple radio interfaces and dedicates a separate radio channel to each. It firstly assigns channels to transmission links so as nodes receive and emit data simultaneously. Then it enhances the routing protocol so that it takes into account both the channel diversity and the channel alternation while choosing the routes. Finally, it adapts the node transmission power in order to favor the channel re-use in each group of nodes that shared the same channel. We detail its principle while it operates with the AODV routing protocol. Analysis of simulation results prove that such an enhanced AODV protocol performs better than existing metrics such as WCETT and can provide a 370% throughput gain.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129717100","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}
引用次数: 4
Topology Control for Throughput Optimization in Wireless Mesh Networks 无线Mesh网络吞吐量优化的拓扑控制
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.13
Deying Li, Baobing Wang, X. Jia
{"title":"Topology Control for Throughput Optimization in Wireless Mesh Networks","authors":"Deying Li, Baobing Wang, X. Jia","doi":"10.1109/MSN.2008.13","DOIUrl":"https://doi.org/10.1109/MSN.2008.13","url":null,"abstract":"In this paper, we consider the problem of topology control by joint power control and routing to maximize the network throughput in wireless mesh networks. First, we present two mathematical formulations of the joint power control and routing problem according to two different definitions of network throughput: the total throughput and the minimal per-node throughput. To reduce the computation cost, we next decompose this joint problem into two sub-problems: the power control sub-problem and the routing sub-problem. For the first sub-problem, we design two heuristic algorithms to assign transmission powers to mesh routers, such that the total interference or the maximum node interference in the network is minimized. For the routing sub-problem, we design two linear programming formulations to maximize the total throughput or the minimal per-node throughput. Simulation results reveal the following relationship: the topology with minimum total interference has higher total throughput, while the topology with minimum maximal node interference has higher minimal per-node throughput. This can server as a guidance for network design to satisfy different throughput considerations.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114127036","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}
引用次数: 9
Signature Scheme with Arbitrary Length Message Recovery in CPK CPK中具有任意长度消息恢复的签名方案
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.21
Che Yong-gang, Jia Chun-fu, Lv Shu-wang, Chen Hui-yan
{"title":"Signature Scheme with Arbitrary Length Message Recovery in CPK","authors":"Che Yong-gang, Jia Chun-fu, Lv Shu-wang, Chen Hui-yan","doi":"10.1109/MSN.2008.21","DOIUrl":"https://doi.org/10.1109/MSN.2008.21","url":null,"abstract":"Digital signature with message recovery is regard as a useful method to shorten signature. This paper presents an identity-based signature scheme with message recovery, which applies to the Combined Public Key System. The scheme is provable secure against existential forgery against adaptively chosen message and ID attacks in the random oracle model under the elliptic curve discrete logarithm assumption. The proposed scheme can recover message with arbitrary length and shorten the total length of the original message and the appended signature compared with others. The proposed scheme is especially suitable for the computation and communication source constrained, such as Ad-hoc network.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292345","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}
引用次数: 3
A Path Reliable Routing Protocol in Mobile Ad Hoc Networks 移动自组织网络中的路径可靠路由协议
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.10
Wei Tang, Wei Guo
{"title":"A Path Reliable Routing Protocol in Mobile Ad Hoc Networks","authors":"Wei Tang, Wei Guo","doi":"10.1109/MSN.2008.10","DOIUrl":"https://doi.org/10.1109/MSN.2008.10","url":null,"abstract":"In mobile ad hoc networks (MANETs), one of the critical issues consists of the design of routing algorithms that are robust to frequent path disruptions caused by hostspsila mobility. This paper analyzes random walk mobility model, and establishes the relationship between a linkpsilas reliability and current lifetime via a conditional probability model. A path reliable routing algorithm is also developed, in which the proposed analytical model is employed. Simulation results show very good agreement to the analytical model, and indicate the benefits of the proposed routing protocol in terms of increasing path duration and packet delivery ratio, as well as reducing packet end-to-end delay.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965784","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}
引用次数: 7
On-Demand Anonymous Routing with Distance Vector Protecting Traffic Privacy in Wireless Multi-hop Networks 无线多跳网络中距离矢量保护流量隐私的按需匿名路由
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.42
Daisuke Takahashi, X. Hong, Yang Xiao
{"title":"On-Demand Anonymous Routing with Distance Vector Protecting Traffic Privacy in Wireless Multi-hop Networks","authors":"Daisuke Takahashi, X. Hong, Yang Xiao","doi":"10.1109/MSN.2008.42","DOIUrl":"https://doi.org/10.1109/MSN.2008.42","url":null,"abstract":"Because of easy accessible medium in wireless networks, use of these wireless networks in military applications poses several security issues. Likewise, in the business field, despite the emerging static wireless Internet access, the same security issues remains. On example is the passive attack in which attackers attempt to overhear network communications from the outside. Confidentiality can be further divided into two categories, namely, data confidentiality and traffic confidentiality. In this paper, for improving traffic confidentiality, we propose two anonymous routing algorithms, called randomized routing algorithm and probabilistic penalty-based routing algorithm. Both algorithms aim to differentiate routing paths to the same destination enhancing anonymity of the network traffic. We provide simulation results and demonstrate how much these two algorithm disperse routing paths in a network.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122514199","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}
引用次数: 8
NEMO-Based Multiple Interfaces Scheme between Overlay Heterogenous Access Networks 基于nemo的覆盖异构接入网间多接口方案
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.28
Xiaohua Chen, Huachun Zhou, Yajuan Qin, Hongke Zhang
{"title":"NEMO-Based Multiple Interfaces Scheme between Overlay Heterogenous Access Networks","authors":"Xiaohua Chen, Huachun Zhou, Yajuan Qin, Hongke Zhang","doi":"10.1109/MSN.2008.28","DOIUrl":"https://doi.org/10.1109/MSN.2008.28","url":null,"abstract":"Network mobility (NEMO) aims managing seamless connectivity for a group of mobile terminals as a whole mobile network. Multiple care of addresses (MCoA) registration scheme was also proposed to address seamless Internet connectivity issue. In this paper we first analyze the upload and download packet loss of mobile router (MR) in NEMO basic support protocol. Then the seamless Internet connectivity of MR which is equipped with WLAN, CDMA and GPRS interfaces is studied and experimented on our platform successfully. Finally, we analyze and compare the performance of packet loss ratio between uni-interfaced and multiple-interfaced MR, and results indicate that multiple interfaced MR can increase the performance of MR obviously when it moves across heterogenous overlay access networks.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123587116","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}
引用次数: 3
Active Protection in Wireless Networking 无线网络中的主动保护
2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks Pub Date : 2008-12-10 DOI: 10.1109/MSN.2008.33
Ming Lei, Yang Xiao, Susan V. Vrbsky
{"title":"Active Protection in Wireless Networking","authors":"Ming Lei, Yang Xiao, Susan V. Vrbsky","doi":"10.1109/MSN.2008.33","DOIUrl":"https://doi.org/10.1109/MSN.2008.33","url":null,"abstract":"Adversaries can easily launch an attack, by taking advantage of the free wireless networking available to the public at many conferences, airports or cafes. Meanwhile in these environments, it is very difficult to identify the adversaries. In this paper, we present a scheme that is designed to defend against potential attacks at a very early stage, in order to minimize the damage to the victims and the entire network. Instead of taking actions only after the attacks arrive at the host, our scheme makes the access point the one who monitors, identifies and prevents potential attacks. In this active protection way, the system can respond more quickly and can also prevent much of the malicious network traffic.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129361672","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信