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

Evaluation of the Power Consumption of Routing Protocols for Wireless Sensor Networks 无线传感器网络路由协议的功耗评估

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-20 DOI: 10.1109/ISAHUC.2006.4290675

G. Santhosh Kumar, L. Varghese, K. Mathew, K. Jacob

引用次数: 2

Securing Mobile Ad Hoc Networks through AntTree Clustering and Threshold Cryptography 通过AntTree聚类和阈值加密保护移动Ad Hoc网络

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290646

P. Subathra, S. Sivagurunathan, G.S.R.E. Selvanj

{"title":"Securing Mobile Ad Hoc Networks through AntTree Clustering and Threshold Cryptography","authors":"P. Subathra, S. Sivagurunathan, G.S.R.E. Selvanj","doi":"10.1109/ISAHUC.2006.4290646","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290646","url":null,"abstract":"Security has become a prime concern in providing communication between mobile nodes in a hostile environment. Unlike wired networks, the unique characteristics of Mobile Ad Hoc networks (MANETs) pose a number of non-trivial challenges to security design. This paper presents a threshold security mechanism with an AntTree clustering algorithm. Nodes which have similar movement pattern are grouped into a cluster. Clustering requires flooding of control information to all the constituent nodes in the network. Flooding is expensive in terms of overhead. It also litters valuable resources such as bandwidth and power. An improvement to flooding is to select probabilistically, a subset of nodes to rebroadcast. To perform efficient clustering, we introduce a new signal strength based metric to estimate the distance between any two nodes in the mobile environment. We employ a threshold cryptographic scheme to protect routing information and data traffic. To ensure distributed trust in the clustered environment, we divide the private key (k) into n pieces in such a way that k is easily reconstructable from any t number of pieces. Even complete knowledge of (t-1) pieces reveal absolutely no information about k.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"285 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":"116107044","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}

引用次数: 6

User Classification Using Mobility Patterns in Macrocellular Wireless Networks 基于移动模式的宏蜂窝无线网络用户分类

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290660

M. S. Sricharan, V. Vaidehi

引用次数: 2

A Survey on Mobility Support by Mac Protocols Using Directional Antennas for Wireless Ad Hoc Networks 无线自组织网络中使用定向天线的Mac协议的移动性支持研究

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290663

P. Kiran

引用次数: 7

Adaptation in Pervasive Computing Environments: A Multi-agent approach 普适计算环境中的自适应:一种多智能体方法

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290670

Vivek Menon

引用次数: 1

Secured on demand Position Based Private Routing Protocol for mobile Adlloc network-SO2P 基于位置的移动Adlloc网络专用路由协议so2p

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290644

M. Jaiganesh, M. Devi, M. Prabakar

{"title":"Secured on demand Position Based Private Routing Protocol for mobile Adlloc network-SO2P","authors":"M. Jaiganesh, M. Devi, M. Prabakar","doi":"10.1109/ISAHUC.2006.4290644","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290644","url":null,"abstract":"Privacy is needed in adhoc networks. A secured on demand position based private routing algorithm is proposed for communication anonymity and provide a security in mobile adhoc network. Here we use cryptography algorithm for providing security to prevent message hacking information from internal & external attackers. The position information of nodes is drawn by GPS (global positioning system). Here, we provide a terminal node behave like server to getting position information of nodes in the network. A simulator based on GLOMOSIM is developed for evaluating security. It provides a secure data transmission between the nodes. In our design, the server with the process of GPS system records all the information about the terminal nodes involved in the ad-hoc networks. This server will send the position reply (PREP) to the source when it receives the position request (PREQ). This PREP is encrypted to provide the security and it's transmitted to all the intermediate nodes in the ad-hoc networks and the intermediate performs decryption and gets the destination address. The intermediate nodes checks with its own address and if it matches it request for the data and it sends node reply, else it will again sends the PREP to all the other intermediate nodes. This node reply is then analyzed to find the optimal route.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"2 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":"130781254","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

A Corrective Approach to Alleviate the Sellishness of Mobile Nodes Indulging in Packet Drop 一种缓解沉溺于丢包的移动节点的销售性的纠正方法

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290652

K. Komathy, P. Narayanasamy

引用次数: 2

Multicast Tree Computation for Group Communication in Mobile Networks using Optimization Techniques 基于优化技术的移动网络组播树计算

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290653

N. Gopalan, C. Mala, R. Shriram, S. Agarwal

{"title":"Multicast Tree Computation for Group Communication in Mobile Networks using Optimization Techniques","authors":"N. Gopalan, C. Mala, R. Shriram, S. Agarwal","doi":"10.1109/ISAHUC.2006.4290653","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290653","url":null,"abstract":"Modern group communication based applications require multiple parameters to be considered for routing in a Cellular network. Traditional algorithms fail in the situations where these parameters frequently change due to the dynamism prevailing in the network. A new technique for topology discovery in these types of networks using ant colony optimization (ACO) has been proposed based on the restricted flooding principle. To provide a better quality of service in routing with multiple constraints, a genetic algorithm based routing has been proposed to find optimal routes within a shorter span of time than the traditional deterministic routing algorithms. Moreover, with the exponential growth in the number of mobile users, to enable a large number of users to participate in a group communication, a parallel genetic algorithm (GA) is proposed in this paper. Our simulation results show that the topology discovery using ant colony optimization is faster. The Call service rate using parallel genetic algorithm is more than that of sequential genetic algorithm and the Call blocking rate of parallel genetic algorithm is less than that of sequential genetic algorithm, for large number of routers in the network.","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":"133644202","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

Secure and Efficient Dynamic Group Key Agreement Protocol for an Ad Hoc Network 安全高效的Ad Hoc网络动态组密钥协商协议

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290648

R. C. Gangwar, A. Sarje

引用次数: 7

An Enhanced Reliability Scheme for Wireless Sensor Networks using PSFQ 基于PSFQ的无线传感器网络可靠性增强方案

2006 International Symposium on Ad Hoc and Ubiquitous Computing Pub Date : 2006-12-01 DOI: 10.1109/ISAHUC.2006.4290656

B. Paramasivan, Dr. S. Radha Krishnan

{"title":"An Enhanced Reliability Scheme for Wireless Sensor Networks using PSFQ","authors":"B. Paramasivan, Dr. S. Radha Krishnan","doi":"10.1109/ISAHUC.2006.4290656","DOIUrl":"https://doi.org/10.1109/ISAHUC.2006.4290656","url":null,"abstract":"There is a growing need to support reliable data communications in Sensor Networks that are capable of supporting new applications. To our knowledge, there has been little work on the design of reliable transport protocols for sensor networks. This is because, vast majority of sensor network applications do not require reliable data delivery. There are a number of challenges associated with the development of a reliable transport protocol for Sensor Networks. Pump Slowly, Fetch Quickly [PSFQ], is the first developed protocol to provide data reliability in sensor networks. PSFQ is a simple, scalable, and robust transport protocol that is customizable to meet the needs of emerging reliable data applications in sensor networks. In this paper, we demonstrate a new dimension of PSFQ as an effort to increase the protocol performance. Here a sensor node is allowed to buffer a sufficiently large amount of data into its buffer, thereby allowing simultaneous transmission of multiple packets. In order to allow a sensor node to hold more number of data we are providing additional buffer space for each node. This enables the node to hold more than one packet in its buffer; thereby a sensor node can transmit more than one packet simultaneously. By this we can get an improved transmission rate and reduced latency. This would also quicken the fetch operation. By more buffer space we can hold more packets for a reasonable amount of time, this will improve the availability of the packets, and hence the fetches are made faster.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"17 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":"133693822","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