SLGP Header


IJCSEC Front Page

Privacy and security have emerged as an important research issue in mobile Ad Hoc Networks (MANET). I proposed how to discover the communication channels without changing the packet content as plaintext, so we present a novel statistical traffic pattern discovery system. By using this system is to identify the Source/destination anonymity and end-to-end anonymity. MANET systems can achieve very restricted communication anonymity under the attack of STARS. In a MANET protected by anonymity enhancing techniques, it is a difficult task itself to identify an actual destination node as the target due to the ad hoc nature. The adversaries are not able to determine whether a particular node is a destination depending on whether the node sends out traffic.
Compared to wired networks, MANETs are more vulnerable to both active and passive attacks. Wireless transmissions are easy to capture remotely and undetected, while the lack of central management and monitoring make network nodes susceptible to active attacks. A sequence of point-to-point traffic matrices is created, and then they are used to derive end-to-end (multihop) relations. First, the scheme fails to address several important constrains when deriving the end-to-end traffic from the one-hop evidences. Second, it does not provide a method to identify the actual source and destination nodes (or to calculate the source/destination probability distribution).They collectively maintain a single predecessor counter for each legitimate node in the system. When an attacker finds himself to be on an anonymous path to the targeted destination, he increments the shared counter for its predecessor node in this path. The counters are then used for the attackers to infer the possible source nodes of the given destination. The adversaries can trace the movement of each mobile node, by using cameras or other types of sensors. In this case, the signals (packets) transmitted by a node can always be associated with it even when the node moves from one spot to another. We propose a novel secure distributed path construction protocol for anonymous communication and wireless ad hoc networks. As opposed to previous related protocols, the proposed protocol does not require the source node to gather and store information about the network topology. Instead, the source node initiates a path establishment process by broadcasting a path discovery message with certain trust requirements to all of neighboring nodes. Intermediate nodes satisfying these trust requirements insert their identification (IDs) and a session key into the path discovery message and forward copies of this message to their selected neighbors until the message gets to its destination. The intermediate nodes encrypt this information before adding it to the message, and only the selected neighbor nodes are able to decrypt it. Once the receiver node receives the message, it retrieves from the message the information about all intermediate nodes, encapsulates this information in a multi-layered message, and sends it along a reverse path in the dissemination tree back to the source node.Each intermediate node along the reverse path removes one encrypted layer from the message, and forwards the message to its ancestor node until the message reaches the source node. When the protocol terminates, the source node ends-up with information about all the trusted intermediate nodes on the discovered route as well as the session keys to encrypt the data transmitted through each of these nodes. The multi-cast mechanism and the layered encryption used in the protocol ensure the anonymity of the sender and receiver nodes.


  1. Berthold.O, et al, (2014) In Proc. Workshop on Design Issues in Anonymity and Unobservability, ICSI TR-00-011, pp. 27–42. “The disadvantages of free mix routes and how to overcome them”.
  2. Dai.W, (2013).”Two Attacks against a pipeNet-Like Protocol Once Used by the Freedom service”
  3. Guo.S,et al,(2009).In Proceedings of the 55th Annual Reliability and Maintainability Symposium (RAMS 2009) on Fort Worth of Texas,USA,January pp.471-476 “Grid service reliability modeling on fault recovery and optimal task scheduling”.
  4. Huang.D(2008)”Unlinkability Measure for IEEE 802.11 based on MANETs “from IEEETrans.Wireless.vol.7,pp.1025-103.
  5. Kong.J,et al,(2007) “An Identity-free and On-demand Routing Scheme against the Ananymity of the presence of Threats in Mobile Computing”.vol.6,no.8,pp.888-902.
  6. YangQin,et al,(2007)”Transaction on the node dependable and secure computing”.