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

2006 International Symposium on Ad Hoc and Ubiquitous Computing最新文献

筛选
英文 中文
Distributed Multi level Security token based Authentication for Ubiquitous Objects-DMSA 基于分布式多级安全令牌的泛在对象认证——dmsa
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290647
U. P. Kulkarni, J. V. Vadavi, S. M. Joshi, K. Sekaran, A. Yardi
{"title":"Distributed Multi level Security token based Authentication for Ubiquitous Objects-DMSA","authors":"U. P. Kulkarni, J. V. Vadavi, S. M. Joshi, K. Sekaran, A. Yardi","doi":"10.1109/ISAHUC.2006.4290647","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290647","url":null,"abstract":"Ubiquitous computing technology provides an environment where users expect to access resources and services anytime and anywhere. The serious security risks and problems arise because resources can now be accessed by almost anyone with a mobile device in such an open model. This paper explores security in ubiquitous computing with focus on authentication. We propose a new model, which uses distributed hierarchical tree based approach for authenticating ubiquitous objects which overcomes the problems associated with centralized source of information.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268690","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
MAC Layer aware Stable Link Routing (MACSLR) in Mobile Adhoc Networks 移动自组网中MAC层感知的稳定链路路由(MACSLR
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290642
Komal Patel, S. Srivastava, R. Lenin
{"title":"MAC Layer aware Stable Link Routing (MACSLR) in Mobile Adhoc Networks","authors":"Komal Patel, S. Srivastava, R. Lenin","doi":"10.1109/ISAHUC.2006.4290642","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290642","url":null,"abstract":"Using cross layer information exchange to build a routing protocol for mobile adhoc networks have been shown to improve the power consumption of the network [10]. In this work we propose a cross layer approach that uses the MAC layer link stability information to improve the routing efficiency. Signal strength of the link is captured from the MAC Layer and used at network layer to predict the future signal strength value using double exponential smoothing model. This information is used to categorize the link as stable or unstable. The proposed MAC Layer aware stable link routing protocol (MACSLR) advertises only those distance vectors whose next hop links are stable. We have simulated the protocol compared its performance with On-Demand Distance Vector[l] and Destination Sequenced Distance Vector[2] protocols. Results show that for lower average overhead, our protocol delivers higher packet delivery ratio and scales well with mobility.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130962644","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
Solution to Prevent Rushing Attack in Wireless Mobile Ad hoc Networks 无线移动自组织网络中防止匆忙攻击的解决方案
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290645
L. Tamilselvan, V. Sankaranarayanan
{"title":"Solution to Prevent Rushing Attack in Wireless Mobile Ad hoc Networks","authors":"L. Tamilselvan, V. Sankaranarayanan","doi":"10.1109/ISAHUC.2006.4290645","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290645","url":null,"abstract":"An ad hoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure or any centralized administration. Due to open medium, dynamic topology, distributed cooperation, constrained capabilities ad hoc networks are vulnerable to many types of security attacks, one such attack is rushing attack. It is a malicious attack that is directed against on demand routing protocols that uses duplicate suppression at each node. The attacker exploits this property in order to prevent communication between the important nodes in the network. To achieve this, it will try to be a part of the route that the source node uses to transmit data to the destination node. By capturing the route successfully, the attacker will disrupt the exchange of packets between the nodes, thus resulting in denial-of-service [1]. This paper focuses on the security of dynamic source routing (DSR) protocol in order to prevent the rushing attack. Based on the simulation study, it is observed that, the new protocol is successful in preventing the rushing attack and provides security even against the strongest rushing attackers with a negligible increase in the end-to-end delay. The new protocol not only enhances the security but also enhances the basic properties of DSR, so that throughput and packet delivery ratio is increased during data transmission.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114475778","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}
引用次数: 23
Implementation of IP Screening / Filtering Using IXP 1200 Network Processor 利用IXP 1200网络处理器实现IP筛选/过滤
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290658
K. Anusuya, S. Rani
{"title":"Implementation of IP Screening / Filtering Using IXP 1200 Network Processor","authors":"K. Anusuya, S. Rani","doi":"10.1109/ISAHUC.2006.4290658","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290658","url":null,"abstract":"This paper proposes a screening/filtering technique to implement a wide variety of network security policies. The primary goal of these policies is generally to prevent unauthorized network access without hindering authorized network access. This technique involves controlling access to a network by analyzing the incoming and outgoing packets and letting them pass or halting them based on the IP addresses of the source and destination. Screening/ filtering is one technique among many for implementing security firewalls.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467013","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
A Comparative Study of Gossip based Multicast Routing Protocols for Wireless Ad Hoc Network 无线Ad Hoc网络中基于八卦的组播路由协议比较研究
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290639
P. Latha, R. Ramachandran
{"title":"A Comparative Study of Gossip based Multicast Routing Protocols for Wireless Ad Hoc Network","authors":"P. Latha, R. Ramachandran","doi":"10.1109/ISAHUC.2006.4290639","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290639","url":null,"abstract":"Multicast routing protocols for mobile adhoc networks has the inability to handle high priority traffic, poor response to network congestion, excessive processing of control information, sub optimal error recovery and retransmission procedures. Gossip is well matched to the needs of ad-hoc networks since it is a controlledform of flooding. Messages are propagated through the network without congesting the wireless medium and are independent of topology. Gossip based approach forwards a message with some probability to reduce the overhead of routing protocols. Gossip protocols are characterized by each node probabilistically choosing to exchange information with another node. Gossip has also been considered as a scalable broadcast solution in wireless network and widely used for distributed protocol design. We analyze in this paper the performance comparison of various gossip protocols viz Anonymous gossip and Route driven gossip for wireless adhoc network that exhibit various topological and mobility characteristics.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"121 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128492488","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
A Distributed Trust Mechanism for Mobile Ad Hoc Networks 移动Ad Hoc网络的分布式信任机制
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290649
J. Sen, P. Chowdhury, I. Sengupta
{"title":"A Distributed Trust Mechanism for Mobile Ad Hoc Networks","authors":"J. Sen, P. Chowdhury, I. Sengupta","doi":"10.1109/ISAHUC.2006.4290649","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290649","url":null,"abstract":"In a multi-hop hop mobile ad hoc network (MANET), mobile nodes cooperate with each other without using any infrastructure such as access points or base stations. The nodes' mobility and fundamentally limited capacity of the wireless medium, together with wireless transmission effects such as attenuation, multi-path propagation, and interference combine to pose significant challenges for security in MANETs. Traditionally, cryptographic mechanisms such as authentication and encryption are not capable of handling some kinds of attacks such as packet dropping by malicious nodes. In this paper, we propose a mechanism for detection of malicious packet dropping attack in MANET. The mechanism depends on a trust module based on the 'reputation' of different nodes in the network. Every node computes the reputation of its neighbors by directly monitoring their behaviors. The reputation information is gathered, stored, and exchanged between the nodes and computed under different scenarios. We have validated the scheme with some simulation work, which shows the feasibility and efficiency of performance of the protocol.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131178872","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}
引用次数: 32
HMAODV: History aware on Multicast Ad Hoc On Demand Distance Vector Routing HMAODV:组播自组织按需距离矢量路由的历史感知
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290643
M. Phani Vijaya Krishna, M. P. Sebastain
{"title":"HMAODV: History aware on Multicast Ad Hoc On Demand Distance Vector Routing","authors":"M. Phani Vijaya Krishna, M. P. Sebastain","doi":"10.1109/ISAHUC.2006.4290643","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290643","url":null,"abstract":"A major aspect of ad-hoc networks is that the nodes move randomly, which requires the routing protocols in ad-hoc network to quickly respond to the network topology change in order to guarantee successful data packet delivery. In this thesis, the multicast ad hoc on-demand distance vector (MAODV) protocol allows each node in the network to send out multicast data packets, and the multicast data packets are broadcast when propagating along the multicast group tree. In addition, several functions are improved in this version. We enhance the MAODV by adding the history awareness on this protocol, which introduces a session history as one of routing metrics. A session history implies how many times and how much duration a node is involved in communication sessions between mobile nodes in a network.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132476264","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}
引用次数: 10
A Pervasive Computing Environment Based on SIP 基于SIP的普适计算环境
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290664
Chyi-Nan Chen, Yi-Shi Wu
{"title":"A Pervasive Computing Environment Based on SIP","authors":"Chyi-Nan Chen, Yi-Shi Wu","doi":"10.1109/ISAHUC.2006.4290664","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290664","url":null,"abstract":"Pervasive computing environment represents a mobile and distributed environment. This brings the challenges for user/device mobility, context awareness, services management and invocation. In this paper, we propose a prototype of pervasive computing environment based on SIP to provide solutions of these challenges and to bring the vision into reality. The architecture of FULL is divided into four layers: network layer, service layer, middleware layer and application layer. The structure and implementation of these four layers are described in detail. Finally, a comparison to other projects is given.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133072326","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}
引用次数: 0
LBOD-SR: An Efficient Routing Scheme for Mobile Ad-hoc Networks with Low Mobility and High Traffic Conditions LBOD-SR:低移动性和高流量条件下移动Ad-hoc网络的有效路由方案
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290674
A. Ramani, S. Silakari, H. Bidwaikar
{"title":"LBOD-SR: An Efficient Routing Scheme for Mobile Ad-hoc Networks with Low Mobility and High Traffic Conditions","authors":"A. Ramani, S. Silakari, H. Bidwaikar","doi":"10.1109/ISAHUC.2006.4290674","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290674","url":null,"abstract":"We present a simple but effective scheme called load balanced on demand protocol with selective route request (LBOD-SR) to balance load at nodes when mobility is low and traffic load is high. This scheme provides the way by which nodes accept or discard the route request packets (RREQ) on basis of their present load conditions so that highly loaded nodes can be prevented by participating in the route discovery process or data transfer in order to minimize end-to-end delay and enhance performance.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134297653","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}
引用次数: 0
802.11 MAC Enhancements: Break Barriers of Wireless Speed 802.11 MAC增强:打破无线速度的障碍
2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290655
J.A. Solar, N. Prithviraj, R. Krishnaveni
{"title":"802.11 MAC Enhancements: Break Barriers of Wireless Speed","authors":"J.A. Solar, N. Prithviraj, R. Krishnaveni","doi":"10.1109/ISAHUC.2006.4290655","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290655","url":null,"abstract":"The 802.11 protocol uses the collision avoidance mechanism .At the MAC layer this is implemented by either a contention based DCF or a contention free PCF methods. Analyzing the throughput and the traffic constraints of such a network, this paper discusses about two methods to increase throughput. The first method suggests a better implementation of the PCF and the second uses a combination of the PCF and the DCF to form a hierarchical recursive function between each hop, decreasing delay by a factor of 1.5.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"604 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233599","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信