Search

The study of Peer-to-Peer (P2P) network and Mobile Ad hoc Network (MANET) are currently two hotspots in distributed domain. We propose a novel anycast based AODV routing protocol which is a simple and efficient routing protocol designed especially for MANET for P2P applications called AAPP (an Anycast based AODV routing protocol for Peer to Peer services in MANET). AAPP integrate DHT protocol operating in a logical namespace and MANET routing protocol operating in a physical namespace. The key idea of the integration is to bring the Chord protocol to the network layer of MANETs via a one-to-one mapping between the service keys of the mobile nodes providing services and their anycast groupIDs in the namespace. The object of our design is to construct a new type of anycast based AODV model for P2P services, especially for discovery service, information administration service, file sharing service, and communication security. It is assumed that the number of anycast groups is steady in a MANET, so we consider the instance that a node joins or leaves an anycast group. When a mobile node attains a service, such as a file and a particular data, it can share its resource to other nodes and becomes a mobile peer. Whenever a mobile node joins or leaves an anycast group, it originates a request packet and sends it to the network layer. The anycast groupID is updated correspondingly, and broadcasts the information about updating information. In this paper, we have designed an anycast based protocol for P2P application in mobile wireless ad hoc networks based on on-demand routing protocols AODV. We have tested the packets' delivery fraction, average end-to end delay of data packets, and normalized the routing protocol performance of anycast protocols by simulation with OPNET on different traffic models, node mobility models, and connection models. With our novel anycast protocol AAPP, the traffic load can be balanced thus, reducing the transmission delay and increase the route utilization which is better for P2P application. That all the members in one anycast group share one anycast address enables them to take the same priority in the routing searching process. Therefore, this approach can provide the transmission path with the shortest length. With scattering of the anycast server in the geographical area, the traffic load is obviously distributed in the network. All these properties can help to improve the performance of the network. [ABSTRACT FROM AUTHOR]

Wireless ad hoc network is formed by a group of mobile hosts that communicate through radio transmissions. In the hostile environment, this kind of network is vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. So, anonymous routing protocol for ad hoc networks is an important thing and has attracted more and more attention recently. In this paper, we propose a novel, secure, and anonymous source routing, called SADSR (Secure and Anonymous Dynamic Source Routing) based on DSR. During the routing request of the SADSR, in order to hide the identity, the source node uses its current pseudonym to sponsor the routing request. And it uses the hash value of the changing share key between the source and destination as the tag of the destination. Meanwhile, it employs an initialized Bloom Filter as the routing record table to record the route. When the intermediate nodes receive the routing request, it randomly chooses a secret key and adds its identity into the Bloom Filter with seeding the secret key. So, when the destination node receives the routing request, the Bloom Filter has recorded the route information. Because the feature of the pseudonym employed in our scheme, the destination node can authenticate the source node and updates their share secret key when it replies to the routing request. During the routing reply phase, the intermediate node can determine whether it is the router by checking the Bloom Filter in the reply packet. The router applies the pseudonym based signature to protect the message during the routing reply phase, which makes sure that the neighborhood node en route can authenticate the upstream node and does not disclose its identity. SADSR also contains the routing maintenance and secure anonymous data transmission which are separately used by the end-to-end validate mechanism and HMAC strategy. The performance of security and anonymity of SADSR is analyzed by both in theory and simulation. Compared to the other anonymous routing protocols, SADSR is not only an anonymous routing protocol, but also a secure one. It can provide authentication and integrity, anonymous neighborhood, identity anonymity, and route anonymity. The simulation results using NS-2 indicate that though SADSR is a secure and anonymous routing protocol, but the efficiency of SADSR is close to the secure routing protocol SDSR and anonymous routing protocol AnonDSR. [ABSTRACT FROM AUTHOR]

A sparse wireless sensor network for forest fire detection is considered. It is assumed that two types of malicious nodes can exist in this network. The malicious behaviors are assumed to be concealed through some statistical behavior. A lightweight centralized trust-based model is proposed to detect malicious or misbehaving nodes. We assume that all nodes contribute to this process through the gathering of statistical data related to communication with their neighbors. These data are periodically sent to a base station, where all trust functions are executed. A simulation model is built to evaluate system performance, and the results show that the proposed model is efficient in detecting all types of considered malicious nodes. [ABSTRACT FROM AUTHOR]