Mission-Guided Key Management for Ad Hoc Sensor Network

The (MANET) ad-hoc mobile network is an automated, network in which android systems link to wireless devices. Ad hoc word means "for this purpose". In MANET any device can easily move in various directions. MANETs (Mobile Ad Hoc Networks) are the basics of broadband networks. In MANET network user can link and get connected anywhere, anytime through communication. MANET introduces a new co system for communication. MANET does not require a fixed structure relies on unconnected ports for service transportation delivery. The temporary hoc network is not dependent on mobile devices (android phones, laptop, PCs, sensors, etc.) that connect exclusively to wireless connectors. Ad-hoc work on a distributed system to provide the required network performance when there is no fixed structure. In this network, it acts as a standalone network or with many attachment points on mobile networks. This paper provides view on the features, applications of ad hoc networks, characteristics and various attacks and challenges faced by programmers and Users . We analyze MANET security objectives and will outline the features, structure, types and challenges of research and the latest trend analysis presented on Mobile Ad Hoc Network to explore open-ended issues in developing navigation strategies for MANET.

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.

An ad-hoc Wireless Local Area Network (WLAN) is a network without infrastructure connectivity where different types of hosts (nodes) exist; such as PDAs (personal digital assistants), laptops and cellular phones. These nodes are equipped with short range transmitters and receivers, and antennas which may be Omni directional (broadcast), highly directional (Point-to-point), or a combination of the two. A Mobile Ad hoc Network (MANET) is a collection of mobile hosts that move in different directions and speeds without the need to maintain connectivity with existing network infrastructure. Different routing protocols have been designed since the existence of ad hoc networks. This work presented below proposes a new routing protocol for ad hoc networks which aims to reduce network overhead, power consumption, Multi-user Interference (MUI), and provide link reliability. In recent years, a vast research has been seen going on in the field of Mobile Ad Hoc Networks (MANETs). Due to limited resources in MANETs, to design an efficient and reliable routing strategy is still a challenge. An intelligent routing strategy is required to efficiently use the limited resources. Also the algorithms designed for traditional wired networks such as link-state or distance vector, does not scale well in wireless environment

A mobile ad hoc network (MANET) consists of a group of mobile nodes (MNs) that communicate with each other without the presence of infrastructure. The wireless mobile hosts communicate in a multihop fashion. In multi-hop wireless ad-hoc networks, designing energy-efficient routing protocols is critical since nodes have very limited energy, computing power and communication capabilities. For such protocols to scale to larger ad-hoc networks, localized algorithms need to be proposed that completely depend on local information. Hence, here introduce a protocol to handle multihop situations known as Energy Efficient Location Based Routing Protocol for MANETs (EELBR) that is based on Location Aided Routing. EELBR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead are significantly reduced. Developing a method to adaptively use one of the forwarding methods of the position-based routing protocol based on the surrounding environments, and dividing the network into a number of areas that varies dynamically based on the node mobility pattern. Then, show through analysis and implementation that it outperforms most of other protocols currently used in practice under various networks.

Mobile Ad hoc Network (MANET) basically, is a collection of mobile hosts incorporating wireless interfaces that forms a transitory autonomous network. They do not base on fixed infrastructure or central administration, rather work on the principle of self-organized interconnections among mobile nodes. Fundamentally, in MANET when nodes come inside the transmission range of neighboring nodes', they can be detected by each other and can communicate directly. However for communication outside this range they have to depend on some other nodes to relay the messages .This is where routing protocols have to play a very important role. Literature for improving the performance of routing protocol is available in abundance. Among these comes, the hierarchical/cluster-based routing protocols that claim to reduce control overheads. Clustering in Mobile Ad hoc Networks (MANETs) has proved to be advantageous compared to the traditional networks. However the highly dynamic and unstable nature of MANETs makes it intricate for the cluster based routing protocols to split a mobile network into clusters and determination of cluster heads for each cluster. Although much previous research has concentrated on cluster-head selection in MANETs, not much effort has been done on the security side of cluster-head selection. This paper emphasize that secure cluster head selection in MANETs has an intense effect on network performance. Specifically, we stress that in ad hoc network where all the participants are self controlled, security is an essential aspect and the effective cluster-head selection can improve network throughput. We propose a secure and effective cluster-head Selection scheme using a cross-layer approach that integrates cluster-head discovery and selection functionality with network ad hoc routing mechanisms and the lower layer drivers built-in the system. Besides, proposed scheme handle the disconnections in ad hoc network due to the effects of topology changes and battery depletion. This scheme allows clients to switch to better cluster-head nodes as network topology changes. Hence, provides better performance to network.

Service discovery is an integral part of Mobile Ad Hoc Networks (MANETs). While several service discovery protocols such as Service Location Protocol [1] and Universal Plug and Play (UPnP)[2] have been developed, most of them are designed for infrastructure based networks and thus not suitable to be used in MANETs. This paper proposes Mobile Agent Based Service Discovery (MASD) for Ad Hoc network. It is a policy driven agent based mechanism that facilitates cross platform service discovery in ad-hoc environments. The various agents are chosen in MASD which executes the predefined policies. Our approach achieves a high degree of flexibility in adapting itself to changes in ad-hoc environments and is aware of common problems associated with structured compound formation in mobile Ad Hoc environments. Mechanism consists of grouping mobile nodes into clusters while a gateway in each cluster is responsible for routing. We evaluated the performance of the scheme by running simulations on Glomosim simulator. Also the motion of agents is taken care of by PMADE (Platform for Mobile Agent Distribution and Execution).The results obtained shows that MASD is quite effective for successful service discovery in MANETs.

The year 2005 witnesses the third occasion that the Wireless Personal Area and Ad-hoc Networks minitrack is part of the annual HICSS conference. This year there was a substantial increase in submissions (thus a substantial decrease in the acceptance rate), indicating the growing importance of research in this area. The minitrack is also focused on fundamental challenges and issues arising in wireless sensor networks and their applications. Wireless sensor networks differ from other wireless networks in the need for unattended and very low-energy operation, in the possibility of collaboration and distributed sensor calibration, and in the mission oriented nature of most sensor networks. Thus our mini track looks at two very important streams of research. After a strict review process nine papers were selected to be included in the program of the minitrack. The first paper is titled “BT-Crowds: Crowds-style Anonymity with Bluetooth and Java,” presenting an interesting idea on how anonymity can be achieved when sending messages in WPAN environments. Our second paper revisits scatternet formation issues of Bluetooth based ad hoc networks thus the title: “A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets.” The third paper is titled “Secure Dynamic Source Routing” and presents a new variant of the DSR routing protocol with special emphasis on security. In the fourth paper, the discussion concerns “Routing Based Feedback towards Applications in Mobile Ad Hoc Networks,” where routing notifications are relayed via event channels. “A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks” is the title of the fifth paper in the minitrack. It presents some innovative ideas on how location information can be managed for multicast communications in ad-hoc networks. In the sixth paper, “Sliding Window Protocol for Secure Group Communication in Ad Hoc Networks,” the authors propose a sliding window protocol for determining multiple routes in a multi-communications environment. In the seventh paper titled “Ad Hoc Routing Protocol Avoiding Route Breaks Based on AODV,” the authors propose improvements to the well-known AODV ad hoc routing protocol The eight paper, “Joint Scheduling and Routing Algorithm for Ad Hoc Wireless,” presents an innovative and interesting idea wrapped around an iterative algorithm on power control. In the final paper of the minitrack, “Performance Issues of Ad Hoc Routing Protocols in a Network Scenario used for VideoPhone Applications,” the authors present a simulation based performance analysis of different ad hoc routing protocols using the application pointed to in the title. These papers highlight some of the issues and work towards solutions in Personal Area and ad hoc networks which are among the most active research fields in wireless networking. We believe that the papers will provide opportunities for researchers to come together and discuss and debate the results of the interesting experiments that are described in the papers. We are confident that the minitrack will achieve its goal of bringing together leading researchers, to present new results and discuss synergies between the two areas. We also take this opportunity to thank all the reviewers for their valuable and professional work as well as all the authors who submitted papers and thus helped us to create such a strong minitrack. We would also like to express our sincere gratitude to the conference organizers for their hard work and help.

A sensor network is a network consisting of small, inexpensive, low-powered sensor nodes that communicate to complete a common task. Sensor nodes are characterized by having limited communication and computation capabilities, energy, and storage. They often are deployed in hostile environments creating a demand for encryption and authentication of the messages sent between them. Due to severe resource constraints on the sensor nodes, efficient key distribution schemes and secure communication protocols with low overhead are desired. In this paper we present an asynchronous group key distribution scheme with no time synchronization requirements. The scheme decreases the number of key updates by providing them on an as needed basis according to the amount of network traffic. We evaluate the CC2420 radio security mechanism and show how to use it as a basis to implement secure group communication using our proposed group key distribution scheme.

The mobile ad hoc networking field has produced several important theoretical results, but in terms of real world implementation and industrial deployment, such net works are suffering scarce exploitation and low interest from the industry and users. This, as discussed in the arti cles of the April 2007 issue of this Series, was mainly due to a lack of realism in the research approach/objectives that produced tons of scientific papers but only a very lim ited number of real deployments, with limited involvement of real users and no killer application. However, by learning the lessons of mobile ad hoc net working and exploiting the theoretical results in realistic networking scenarios, the scientific community has been able to design a set of novel mobile ad hoc networking paradigms that are currently penetrating the mass market. Mesh networks, where the multihop ad hoc networking paradigm is extended to include some infrastructure ele ments to provide a cost-effective wireless broadband exten sion of the Internet, is currently a reality, and we can find mesh network installations in many cities and campuses. While a more comprehensive analysis of those paradigms derived by Mobile Ad Hoc Networking, this issue presents two papers that survey the research in two of those paradigms: the vehicular networks and the opportunistic networks.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

Power control algorithms for mobile ad hoc networks

Ad Hoc usually relates to an explanation of planning to address a particular issue or function, which although not generic, but also is inappropriate for the achievement of the other objectives. The ad-hoc networks have been particularly designed for establishing communications in environments where they are extremely complicated or infeasible for creating the specific network infrastructure. Most of these ad hoc networks are spontaneously formed by the consumers. The astounding reality is that the number of devices which are able to maintain wireless communications is increasing on a daily basis. Ad hoc networks are beneficial for implementation in considerable sets of scenarios, for instance, in universities, museums, emergency relief or investigation tasks, where the ability to allocate resources and services is one of the primary attentions. In this paper detailed clarifications of the wireless ad-hoc networks, their historical reviews and application in present scenarios. It clarifies several types of such networks like, mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), wireless mesh networks (WMNs), and vehicular ad hoc networks (VANETs). Then, it also concentrates primarily on the utilization of the MANET, besides achieving the crucial task of classifications, characteristics, challenges, potential fields for the implementation of the ad hoc, differences and the developments of routing protocols.

The wireless interfaces in Mobile Ad-Hoc Networks (MANETs) have limited transmission range and traffic is relayed through intermediate nodes to ensure intra node communication. Routing plays an important role in network reliability and performance. MANET's characteristics like mobility and resource constraints adversely affect routing performance. A new MANET routing method based on Ad hoc On- demand Distance Vector (AODV) and Ant Colony Optimization is proposed in this paper. Ad hoc networks can emulate achievement of complex solutions with limited intelligence and individual capacity as seen in ant communities. A new link quality metric enhances AODV routing algorithm to enable it to handle link quality to evaluate routes between nodes.

Homogeneous wireless sensor networks (HWSNs) are a class of WSNs in which nodes have identical hardware configurations. A HWSN inherits the same constraints from WSNs such as limited processing capacity and resources. However, the unique characteristic of HWSNs gets more attention for recent security applications. The environment of these applications mandates lightweight security provisions, especially a key management protocol that endures security threats such as node capture attack. On the other hand, the limited computation and communication capabilities of sensor nodes make it hard to deal with such security threats. Thus, in this paper, we introduce a novel clustering paradigm to be used in a key pre-distribution key management scheme designed for HWSNs. Then, we develop a cluster-based key pre-distribution based on this paradigm. Our developed scheme improves the security dramatically by partitioning sensor nodes to the disjointed clusters and letting clusters to be inter-connected via randomly selected nodes as consular nodes from all the clusters to form a universal cluster. As opposed to the adopted schemes, we provide a comprehensive analysis for both sensor node connectivity, and resiliency against node capture attack, and also computational results are presented.