Restoring Inter node Connectivity using RIM algorithm
Recent years have witnessed a growing interest in the applications of wireless sensor networks (WSNs). In some of these applications, such as search and rescue and battlefield reconnaissance, a set of mobile nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks. Such collaboration among the sensors requires internode interaction and thus maintaining network connectivity is critical to the effectiveness of WSNs. While connectivity can be provisioned at startup time and then sustained through careful coordination when nodes move, a sudden failure of a node poses a challenge since the network may get partitioned. This paper presents RIM; a distributed algorithm for Recovery through Inward Motion. RIM strives to efficiently restore the network connectivity after a node failure. Instead of performing a networkwide analysis to assess the impact of the node failure and orchestrate a course of action, RIM triggers a local recovery process by relocating the neighbors of the lost node. In addition to minimizing the messaging overhead, RIM opts to reduce the distance that the individual nodes have to travel during the recovery. The correctness of the RIM algorithm is proven and the incurred overhead is analyzed. The performance of RIM is validated through simulation experiments.
Existing system:
In existing recovery of node concept,the loss of link between every nodes.so the child will not follow a parent node.
Proposed system:
In recent years, there has been a growing interest in the use of WSNs in inhospitable environments. In these application setups, human intervention is highly undesirable and employing a WSN becomes invaluable. Operating in such a harsh environment makes nodes susceptible to failure and/or damage, which may negatively impact the application. In this paper, we have investigated the problem of restoring network connectivity after the failure of a node. We have introduced RIM; a distributed algorithm for Recovery through Inward Motion. Unlike other schemes found in the literature, and which perform a network wide analysis to assess the impact of the node failure, RIM triggers a local recovery process by relocating the neighbors of the lost node. In addition to minimizing the messaging overhead, RIM reduces the distance that the individual nodes have to travel during the recovery.
Software Requirements:
Operating System : Windows XP Front End : Java Swing Programming tool : net beans Networking Tool : Sockets Protocol : TCP Packets Transferring : I/O Concepts, Threads
Maintain neighbors list like port or IP Address Maintain link from Neighbors Sender If deleted or added apply rim algorithm Initiating the neighbor joining process Use case diagram:
sender
Receiver
Net work model Neighbour list Neighbour join Apply sequrntial topology inference algorithm Sequence diagram:
If failure Send packet Detected Apply algorithm
Neighbor joining
Sender Sequential topology interface Receiver Receiver Class Diagram:
This is the sender node of our concept, and all the nodes are placed in a seapared in a each position. Maintaining a List of One-Hop Neighbors The only knowledge, which RIM requires, is for each node to have a list of its 1-hop neighbors with their relative position and proximity. At network setup, every mobile node broadcasts a HELLO message to introduce itself to its neighbors. A node then establishes a list of directly reachable nodes, i.e., 1-hop neighbors. The 1-hop neighbors table is maintained during the network operation to reflect changes in the topology. Each entry in the table contains two parameters {Node_ID, Relative position}, where Node_ID is a unique identification assigned to each node in the WSN. The 1-hop table would have mixed refresh and stale entries while restoring connectivity, until the WSN converges to a new topology. A node that changes its position will inform its neighbors beforehand in order to avoid being wrongfully perceived as faulty.
Sender Maintain neighbors list like port or IP Address Maintain position from Neighbors
2) Receivers 1,2: This is the next level of rootnode.here we are going to implement a RIM algorithm concept.so when this parentnodes are failed then find out a corresponding next node Is restored in this position.and also maintain another links to childnodes.
3)RESTORING CONNECTIVITY
Detailed RIM Approach Receiver Maintain neighbors list like port or IP Address Maintain position from Neighbors If failure detected apply RIM algorithm The proposed RIM approach exploits the nodes mobility and requires only 1-hop neighbor information to recover from a node failure. The restoration process is both localized in scope and distributed in execution, requiring no networkwide coordination among nodes. Each node can independently decide its role in the restoration process, and where to move if needed. RIM requires each node to be aware of the location of its 1-hop neighbors.
Detecting a Failure and Initiating the Recovery Process
Nodes will periodically send heartbeat messages to their neighbors to ensure that they are functional. Missing heartbeat messages can be used to detect the failure of a node.
RIM algorithm Detect failure Initiating the recovery process
4)Nodes1,2,3,4: These nodes are arranged in child of the every parentnodes.so anyone nodes will go for a restoring position into a parent node.
Architecture Diagram:
Node fail
Rim algorithm steps: Root node P2 P1 C 3 C 1 C 2 C 4 Root node C 3 C 4