Open Access Open Access  Restricted Access Subscription or Fee Access

Data Security in Wireless Sensor Networks Using a Star Topology Approach

Sajana Tiruveedhula, Y. Chitti Babu

Abstract


Security has become one of the major issues for data communication over Wired and Wireless sensor networks. Consider wireless sensor networks while transferring the data it can be attacked by different kinds of attacks such as compromised node, denial of service attacks. We agree that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. By considering the routing algorithm, it can compute the same routes known to the source, therefore all information sent over these routes. To secure the data from these attacks we can generate randomized multipath routes. These routes are taken by the shares of different packets change over time. While sending the data the randomized multi path routes include the same routes. In this paper, “instead of selecting self nodes “we generate dynamic multi path routing in which the shares of different packets are taken and send to the destination. We develop efficient topology for delivery the data in secure manner. The experimental results show that topology out performs traditional schemes in terms of CPU cost, minimization of retransmissions.

Keywords


Data Security, Message Transmission, Randomized Multi Path Routing, Star Topology, Wireless Sensor Networks.

Full Text:

PDF

References


C.L. Barrett, S.J. Eidenbenz, L. Kroc, M. Marathe, and J.P. Smith, “Parametric Probabilistic Sensor Network Routing,” Proc. ACM Int’l Conf. Wireless Sensor Networks and Applications (WSNA).

M. Burmester and T.V. Le, “Secure Multipath Communication in Mobile Ad Hoc Networks,” Proc. Int’l Conf. Information Technology: Coding and Computing, pp. 405-409, 2004.

T. Claveirole, M.D. de Amorim, M. Abdulla, and Y. Viniotis, “Securing Wireless Sensor Networks Against Aggregator Compromises,” IEEE Comm. Magazine, vol. 46, no. 4, pp. 134-141, Apr. 2008.

D.B. Johnson, D.A. Maltz, and J. Bruch, “DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks,” Ad Hoc Networking, C.E. Perkins, ed., pp. 139-172, Addison-Wesley, 2001.

P.C. Lee, V. Misra, and D. Rubenstein, “Distributed Algorithms for Secure Multipath Routing,” Proc. IEEE INFOCOM, pp. 1952- 1963, Mar. 2005.

P.C. Lee, V. Misra, and D. Rubenstein, “Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks,” IEEE/ ACM Trans. Networking, vol. 15, no. 6, pp. 1490-1501, Dec. 2007.

X.Y. Li, K. Moaveninejad, and O. Frieder, “Regional Gossip Routing Wireless Ad Hoc Networks,” ACM J. Mobile Networks and Applications, vol. 10, nos. 1-2, pp. 61-77, Feb. 2005.

S.J. Lee and M. Gerla, “Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks,” Proc. IEEE Int’l Conf. Comm.(ICC), pp. 3201-3205, 2001.

I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp- 102-114, Aug. 2002.

W. Lou and Y. Kwon, “H-Spread: A Hybrid Multipath Scheme for

Secure and Reliable Data Collection in Wireless Sensor Networks,”IEEE Trans. Vehicular Technology, vol. 55, no. 4, pp. 1320-1330, July 2006.

W. Lou, W. Liu, and Y. Fang, “Spread: Enhancing Data confidentiality in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, vol. 4, pp. 2404-2413, Mar. 2004.

W. Lou, W. Liu, and Y. Zhang, “Performance Optimization Using

Multipath Routing in Mobile Ad Hoc and Wireless Sensor Networks,” Proc. Combinatorial Optimization in Comm. Networks,pp. 117-146, 2006.

M.K. Marina and S.R. Das, “On-Demand Multipath Distance Vector Routing in Ad Hoc Networks,” Proc. IEEE Int’l Conf. Network Protocols (ICNP), pp. 14-23, Nov. 2001.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.