Shortest Path Based Routing Algorithms Using Conditional Intermeeting in Wireless Sensor Networks
With the spreading application of Wireless Sensor Networks (WSNs) in various sensitive areas such as health-care, military, habitat monitoring, etc., the need to ensure security and privacy is becoming imperatively important. For example, in battlefield application scenario, "The location of soldiers should not be exposed if they initiate broadcast query". In the meantime, query must be transferred to the destination in an encrypted manner via only trusted en-route nodes. Full network level privacy has often been categorized into four sub-categories: identity, route, location and data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS (Quality-of-Service) issues (e.g., packet reach-ability and timeliness).