Wireless Ad-hoc Network Environment Research Articles

A provably secure cluster-based hybrid hierarchical group key agreement for large wireless ad hoc networks

Group key agreement protocol permits a set of users to create a common key to make sure security of information exchange among members of the group. It is extensively used in secure multiparty computation, resource security sharing, and distributed collaborative computing etc. For large wireless ad-hoc network, there is no authentication center, the computing power and communication distance of terminals are constrained, and nodes frequently join and exit the network. For these reasons, Group Key Management for securing multicast communications in an energy-constrained large wireless ad-hoc network environment is still remains a critical and challenging issue. In this direction, we propose a cluster-based hybrid hierarchical-group key agreement (CHH-GKA) framework to provide a scalable solution for Secure Group Communication (SGC) in large wireless ad hoc networks (WANETs). This technique is based on splitting a large group into a certain number of clusters in which the last member of each of the clusters is designated as a cluster head (CH) and the last member of the group is designated as the group controller (GC). First we apply on hand Naresh–Murthy-group key agreement (NM-GKA) protocol locally in every cluster in parallel in level-I to generate CKs and then in level-II, the CHs’ use these CKs and implement NM-GKA protocol again among them to form the complete group key. Finally each CH distributes the group key to all its members through their respective CK encrypted links. In this process, first we survey several cluster-based hierarchical GKA protocols and compare the proposed one with them and show that it provides optimal performance with regard to computation and communication expenses. Further, it also handles dynamic events and is provably secure in formal security model under the cryptographic suppositions.

Analytical models for trust based routing protocols in wireless ad hoc networks

In Wireless Ad Hoc Network environment, there are three ways to understand a routing protocol: (i) monitoring, (ii) simulation and (iii) modeling. In this paper, the different trust based secure routing protocols used in wireless ad hoc networks are analyzed, modeled and described by incorporating process flow diagrams. These process flow diagrams represent stepwise work flow activities and actions. It shows the overall flow of control of a process, program or a protocol. This paper focuses on the security aspects of routing by incorporating trust parameter into account and also highlights methodology used in secure routing protocols. Such protocols have been categorized based on the model used for enforcing security, methodology and information for making effective routing decisions. In this paper, we model, discuss and analyze trust based secure ad hoc routing schemes which do not require each network node to work in promiscuous mode. We propose and design a new protocol - Trust based Routing using Dominating Set Approach (TRDSA) which overcomes the shortcomings of existing protocols.

AN INCENTIVE MECHANISM FOR AD-HOC WIRELESS CONTENT SERVICE: CONTEXTUALIZED MICRO PRICING

Sophisticated mobile wireless, net-connected devices are allowing people who do not know each other to cluster temporarily around information of mutual interest. Rheingold characterized the sociology of this brave new world of social medium as a world of "ad-hocracy". This paper aims to explore a force that can drive context-sensitive companionable relationships or activities in the "ad-hocracy" world of wireless ad-hoc networks and presents a contextualized micro-pricing mechanism for content services operating in the environment of wireless ad-hoc networks. This is a novel effective pricing mechanism that involves both value-based pricing and contextualized consideration of perishability (in terms of time, location, and urgency). This mechanism is the first attempt in adding the contextual element into pricing and is believed to encourage further exploration of pricing methods in the "ad-hocracy" world. The notion of contextualized micro-pricing is believed not only to improve mobile peers' willingness to furnish differentiated services but also to enhance the distribution of the service resources on the social medium of the wireless ad-hoc network environments.

무선 이동 애드-혹 네트워크를 위한 다중 경로 소스 라우팅 프로토콜과 Mobile-IP의 연동 기법

현재 홈 네트워크, 센서 네트워크, 유비쿼터스 네트워크 등에 대한 활발한 연구가 진행되면서 무선 이동 애드-흑 네트워크에 대한 관심이 높아지고 있다. 무선 이동 애드-혹 네트워크란 기존의 유선 하부구조의 도움 없이 이동 호스트들만으로 구성되는 임시적인 네트워크로, 언제어디서나 컴퓨팅 환경을 이용할 수 있도록 하는 개념의 유비쿼터스 컴퓨팅 환경에 적합한 네트워크이다. 본 논문에서는 다중 소스 라우팅 프로토콜 기반의 무선 이동 애드-혹 네트워크 환경과 Mobile-IP 기반의 네트워크 환경을 연동하는 기법에 대해 제안하고자 한다. 본 논문에서 제안하는 기법은 무선 이동 애드-혹 네트워크 내의 이동 호스트와 기지국간 다중 경로를 유지함으로써 경로 단절시 경로 재설정 및 재등록으로 인한 오버헤드를 줄이며 무선 이동 애드-혹 네트워크 내의 패킷을 Mobile-IP 패킷으로 변환하는 기능을 기지국에서 수행하도록 함으로써 이동호스트들의 오버헤드를 감소시키는 기법이다. 성능 평가를 통해, 본 논문에서 제안하는 기법이 단일 경로를 사용하는 일반적인 연동 기법들보다 이동 속도 증가에 따른 처리량 및 단대단 지연이 보다 안정적이며, 노드/링크가 전혀 중복되지 않는 다중 경로를 사용하는 기법에 비해 낮은 오버헤드를 가짐을 보인다. As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of my existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an interconnection scheme between the wireless ad-hoc network environment based on multiple path source routing protocol and a Mobile-IP based network environment. This scheme reduces the overhead of route re-establishment and re-registration by maintaining multiple paths between the mobile host in wireless ad-hoc network and the base station in mobile-IP network. Also it puts the base station in charge of function that performs translation between wireless ad-hoc network packets and Mobile-IP packets, reducing the load of mobile hosts. In this paper, our simulations show that our scheme outperforms existing interconnecting schemes with regards to throughput and end-to-end delay Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.