Author : Bhargavi G 1
Date of Publication :7th May 2016
Abstract: Intelligent (Cognitive) radio networks have a large communication spectrum. This is dynamic in nature. This leads to the necessity for main central channel where two nodes can talk to each other and conclude on the parameters for information exchange between each other, for this they need to meet on a pre-decided channel to communicate, this channel where the decisions are made should be decided by making use of the full available spectrum. In order to reduce collisions and also to make use of the entire available spectrum, a protocol must be devised. ETCH (An efficient channel hopping based MAC layer protocol) is proposed for communication establishment between cognitive radio networks. Two other protocols, Synchronous-ETCH and asynchronousETCH, assuming the presence of global clock synchronization and one without the assumption of existence of a global clock respectively.
Reference :
-
[1] Jia-Dong Zhang and Yin Chow, IEEE Member,”Real: A reciprocal protocol for location privacy in wireless sensor networks”,Pages 458-471,2015.
[2] A. A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” Comput. Commun., vol. 30, nos. 14/15, pp. 2826–2841, 2007.
[3] J. N. Al-Karaki and A. E. Kamal, “Routing techniques in wireless sensor networks: A survey,” IEEE Wireless Commun., vol. 11, no. 6, pp. 6–28, Dec. 2004.
[4] B. Bamba, L. Liu, P. Pesti, and T. Wang, “Supporting anonymous location queries in mobile environments with privacy grid,” in Proc. 17th Int. Conf. World Wide Web, 2008, pp. 237–246..
[5] D. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Trans. Commun., vol. COM.29, no. 11, pp. 1694–1701, Nov. 1981.
[6] S. Bandyopadhyay and E. J. Coyle, “An energy efficient hierarchical clustering algorithm for wireless sensor networks,” in Proc. IEEE INFOCOM, 2003, pp. 1713–1723.
[7] P. Belsis and G. Pantziou, “A k-anonymity privacypreserving approach in wireless medical monitoring environments,” Pers.UbiquitousComput., vol. 18, no. 1, pp. 61–74, 2014.
[8] H. Chan and A. Perrig, “Ace: An emergent algorithm for highly uniform cluster formation,” in Proc. 1st Eur. Workshop Sensor Netw., 2004, pp. 154–171.
[9] J. Chen, H. Xu, and L. Zhu, “Query-aware location privacy model based on p-sensitive and k-anonymity for road networks,” in Internet of Things. New York, NY, USA: Springer,
2012.
[10] C.-Y. Chow, M. F. Mokbel, and T. He, “TinyCasper: A privacypreserving aggregate location monitoring system in wireless sensor networks (Demo),” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2008, pp. 1307–1310.
[11] C.-Y. Chow, M. F. Mokbel, and T. He, “A privacypreserving location monitoring system for wireless sensor networks,” IEEE Trans. MoblieComput., vol. 10, no. 1, pp. 94–107, Jan. 2011.
[12] P. Ding, J. Holliday, and A. Celik, “Distributed energy-efficient hierarchical clustering for wireless sensor networks,” in Proc. First IEEE Int. Conf. Distrib. Comput. Sensor Syst., 2005, pp. 322–339.
[13] J. Freudiger, M. H. Manshaei, J.-P. Hubaux, and D. C. Parkes, “Non-cooperative location privacy,” IEEE Trans. Dependable Secure Comput., vol. 10, no. 2, pp. 84–98, Mar./Apr. 2013.
[14] B. Gedik and L. Liu, “Protecting location privacy with personalized k-anonymity: Architecture and algorithms,” IEEE Trans. Mobile Comput., vol. 7, no. 1, pp. 1–18, Jan. 2008.
[15] G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan, “Private queries in location based services: Anonymizers are not necessary,” in Proc. ACM SIGMOD Int. Conf. Manage. data, 2008, pp. 121–132