RESEARCH

My primary research interests are:

• Anonymity and Privacy in wireless ad hoc networks

Abstract:

Anonymity and privacy in wireless networks is an important facet of research. Privacy and anonymity are closely related in a network, because the need for privacy from identification and traffic analysis requires the use of strong anonymity techniques by the communicating entities. In this area, we have proposed anonymity schemes in wireless sensor networks. Our techniques use keyed hash functions and pseudorandom functions. We have also implemented our schemes (available for download) on the Tmotes using nesC and running on TinyOS. With current research focus on Vehicular Ad Hoc Networks (VANETs) and RFID based systems, we have also proposed efficient anonymous protocols with provably good security for privacy preservation in VANETs and RFID systems. For VANETs, we proposed a pairing and elliptical curve cryptography based solution which performs better than the state of the art. For the RFID system, we proposed a protocol that uses efficient operations such as pseudorandom number generation, XOR, and bit rotation operations to provide anonymous authentication for the RFID tags.

1. Satyajayant Misra and Guoliang Xue, "Efficient anonymity schemes for clustered wireless sensor networks", International Journal of Sensor Networks (IJSNET), vol. 1, no. 1/2, 2006.(pdf)
2. Satyajayant Misra and Guoliang Xue, "SAS: A simple anonymity scheme for clustered wireless sensor networks", Proceedings of International Conference on Communications (ICC), 2006.(pdf)(ppt)
3. Satyajayant Misra, Mayank Verma, Dijiang Huang, and Guoliang Xue, "SEAS: A Secure and Efficient Anonymity Scheme for Low-Cost RFID tags", accepted to ICC, 2009.

• Secure Localization and Target Tracking in wireless sensor and ad hoc networks

Abstract:

In a wireless sensor and ad hoc network, the nodes are localized using specialized nodes called the anchors or beacon nodes that are equipped with GPS receivers. The anchors can be easily compromised by an adversary in the network to localize the nodes incorrectly. Due to the compromised anchors many types of attacks may be mounted on the system. We propose schemes based on convex optimization and clustering of localization information to perform secure localization in the presence of these compromised hence malicious anchors. Our schemes also identify a significant number of the compromised anchors making it possible to revoke them.

1. Satyajayant Misra, Sarvesh Bhardwaj and Guoliang Xue, "ROSETTA: Robust and Secure Target Tracking in a wireless ad hoc environment", Proceedings of Military Communication Conference (MILCOM), 2006.(pdf)(ppt).
2. Satyajayant Misra, Guoliang Xue and Aviral Shrivastava, "Robust Localization in Wireless Sensor Networks through the Revocation of Malicious Anchors", Proceedings of International Conference on Communications (ICC), 2007.(pdf)(ppt)
3. Satyajayant Misra and Guoliang Xue, "CluRoL: Clustering based robust localization in wireless sensor networks," Proceedings of IEEE Military Communications Conference (MILCOM), 2007.(pdf)(ppt)
4. Satyajayant Misra, Guoliang Xue, and Sarvesh Bhardwaj, "Secure and Robust Localization In A Wireless Ad Hoc Environment," accepted for publication in IEEE Transactions on Vehicular Technology (TVT), March 2009.(pdf)

• Fault Tolerance and Robust Relays and Base Station Placement in wireless sensor networks

Abstract:

The sensor nodes in a wireless sensor network are severely constrained in terms of power and range of communication. To improve the connectivity and lifetime of the network relay nodes can be placed in the network. The sensor nodes communicate with the base station with the help of the relay nodes thus being able to conserve their energy hence improve network lifetime. We have studied two setups for the relay nodes placement problem. In the first, the relay nodes can be placed anywhere in the network. In the second, the placement is constrained to a given set of points in the network. We proposed efficient algorithms with constant approximation ratios that place the minimum number of relay nodes in a way that the required connectivity and survivability requirements are met. We also study the problem of placement of the base station in the network to improve network lifetime.

Weiyi Zhang, Guoliang Xue and Satyajayant Misra, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms", Proceedings of INFOCOM, 2007.(pdf)(ppt)

Satyajayant Misra, Seung Dong Hong, Guoliang Xue, and Jian Tang, "Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements," IEEE INFOCOM 2008. (pdf)(ppt)

Satyajayant Misra, Seung Dong Hong, Guoliang Xue, and Jian Tang, "Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations," accepted in the IEEE/ACM Transaction on Networking.

• Multimedia Streaming in wireless sensor networks

1. Satyajayant Misra, Martin Reisslein and Guoliang Xue, "Multimedia Streaming in Wireless Sensor Networks", submitted to IEEE Communications Surveys and Tutorials.(pdf)

<-->