Total views : 173

Location Dependent Key Predistribution Scheme for Square Grid and Hexagonal Grid


  • Department of Computer Science and Engineering, North Eastern Regional Institute of Science and Technology, NH-415, District Papum Pare, Nirjuli - 791109, Arunachal Pradesh, India
  • Department of Electronics and Communication Engineering, North Eastern Regional Institute of Science and Technology, NH-415, District Papum Pare, Nirjuli - 791109, Arunachal Pradesh, India


Objective: To design a location aware key pre-distribution scheme for wireless sensor network deployed in square grid and hexagonal grid with minimum possible keys stored in each nodes. Methods/Statistical analysis: In location dependent key predistribution coordinates of the sensor nodes are known prior to deployment. Therefore their connectivity is known prior. Grid structured network is well fitted topology for various types of application in sensor network. Coverage and connectivity issues have been studied in these kinds of network. Security for these special structured is emerging topic of study and key predistribution as well. Findings: To efficient use of preloaded keys of the sensor nodes, the keys need to be distributed smartly. As in case of a square or hexagonal grid locations are known prior therefore it gives advantage in distributing the symmetric keys over the nodes. In this paper, we propose an algorithm using adjacency matrix of the network for square and hexagonal grid network. We analyze resilience against popular attack like node capture attack and node fabrication attack at the end of this paper. Application/Improvements: Staring with single key distribution, pair-wise key distribution, random key distribution and so on, various key predistribution schemes have been proposed in literature. Taking the advantage of structured topology of sensor network the algorithm enhances the overall performance.


Deployment Knowledge, Hexagonal Grid Network, Key Predistribution Scheme, Location Dependent, Square Grid Network, Wireless Sensor Network

Full Text:

 |  (PDF views: 180)


  • Eschenauer L, Gligor VD. A key-management scheme for distributed sensor networks. ACM: Proceedings of 9th Conference on Computer and Communication Security (CCS-02). November 2002; p. 41-47. Crossref
  • Du W, Deng J, Han YS, Chen S, Varshney PK. A key management scheme for wireless sensor networks using deployment knowledge. IEEE INFOCOM. 2004 March.
  • Liu D, Ning P. Location-based pairwise key establishments for static sensor networks. ACM: Proceedings of the 1st workshop on Security of ad hoc and sensor networks (CCS’03). 2003; p. 72-82. Crossref
  • Martin KM, Paterson MB. An application-oriented framework for wireless sensor network key establishment.Electronic Notes in Theoretical Computer Sciences. 2008; 192(2):31-41. Crossref
  • Romer K, Mattern F. The design space of wireless sensor networks. IEEE Wireless Communications Maga-zine.2004; 11(6):54-61. Crossref
  • SoilNet - a Zigbee based soil moisture sensor network. Date accessed: 15/01/2017: Available from: Crossref .
  • Integrated smart sensing systems., Date accessed: 15/01/2017: Available from: Crossref .
  • McCulloch J, McCarthy P, Guru SM, Peng W, Hugo D, Terhorst A. Wireless sensor network deployment for water use efficiency in irrigation. ACM: Proceedings of the workshop on Real-world wireless sensor networks. 2008 April; p. 46-50. Crossref
  • Camtepe SA, Yener B. Combinatorial design of key distribution mechanisms for wireless sensor networks. Heidelberg: Springer Berlin: European Symposium on Research in Computer Security. 2004 Sep 13; p. 293-308.
  • Saikia M, Hussain MA. Improving the performance of key pre-distribution scheme in sensor network using clustering of combinatorics. IEEE, 2016 International Conference on Computing, Communication and Automation (ICCCA).2016 Apr 29; p. 682-686. Crossref
  • Blackburn SR, Etzion T, Martin KM, Paterson MB. Efficient key predistribution for grid-based wireless sensor networks.Springer: International Conference on Information Theoretic Security, Lecture Notes in Computer Science.2008; 5155:54-69. Crossref
  • Blackburn SR, Etzion T, Martin KM, Paterson MB. Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Transactions onInformation Theory. 2010 Aug; 56(8):3961-72. Crossref
  • Bose RC. An affine analogue of Singer’s theorem. Journal of Indian Mathematical Society. 1942; 6(1-15):15.
  • Blackburn SR, Etzion T, Martin KM, Paterson MB. Two-dimensional patterns with distinct differencesconstructions, bounds, and maximal anticodes. IEEE Transactions on Information Theory. 2010 Mar; 56(3):121629. Crossref


  • There are currently no refbacks.

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