A Detail Performance Evaluation of the Novel Mechanisms Ensuring Maximum Connectivity and Data Transmission between Nodes, Based on the Heuristics Under 5-Color Clustered Response Approach

  • Mahdi Nasrullah Al-Ameen
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 64)


To efficiently manage the sensor networks the topology of the entire network has to be discovered by the monitoring node. In this paper, a novel topology discovery algorithm for sensor networks is proposed. The algorithm finds a set of distinguished nodes, using whose neighborhood information the approximate topology of the network is constructed. Only these distinguished nodes reply back to the topology discovery probes. These nodes logically organize the network in the form of clusters comprising nodes in their neighborhood. Topology discovery algorithms form a tree of clusters rooted at the monitoring node, which initiates the topology discovery process. This organization is used for efficient data dissemination and aggregation, duty cycle assignment and fault tolerance of the network system. The unpredictable behaviors of sensor networks have made it a vital point that how the operational nodes will be managed when a node in the network fails. In this paper, novel fault tolerance mechanism for sensor networks is proposed based on clustered response approach on considering different scenarios that may come to consideration when a node fails; thus ensuring maximum connectivity among operational nodes after the failure of a node. The mechanism explains how the information packets transmitted to the faulty node can be cached by an operational node. After being repaired the faulty node is reinstalled to operational state and the mechanism of getting the repaired node connected to the network is proposed in this paper. Reverse traverse mechanism has been proposed in this paper as a part of fault tolerance mechanisms, which ensures that the number of clusters is not increased when a faulty node is repaired and re-connected to the network. A novel mechanism for duty cycle assignment based on clustered response approach has been proposed in this paper. The proposed mechanism clearly defines how a packet of information is transmitted between a pair of clusters. In this case, a set of nodes from a cluster is selected by the cluster head for communication with another cluster. So, each cluster has a specific set of selected nodes to communicate with a certain cluster and this node-selection mechanism is discussed in detail in this paper. Priority factor of nodes and also their reliability and energy factors have been considered to constitute this selection mechanism. Distance between nodes and nodes within the communication region are other parameters for the selection mechanism which are evaluated using fuzzy evaluation. The mechanisms proposed in this paper are distributed and highly scalable.


Sensor Network Wireless Sensor Network Cluster Head Communication Range Successful Transmission 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cairci, E.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Bao, L., Garcia-Luna-Aceves, J.J.: Topology Management in Ad Hoc Networks. In: Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc 2003), Annapolis, Maryland, June 1-3 (2003)Google Scholar
  3. 3.
    Borbash, S.A., Jennings, E.H.: Distributed Topology Control Algorithm for Multihop Wireless Networks. In: Proc. 2002 Int’l Joint Conf. Neural Networks, IJCNN, vol. 1, pp. 355–360 (2002)Google Scholar
  4. 4.
    Bulusu, N., Estrin, D., Girod, L., Heideman, J.: Scalable coordination for wireless sensor networks: self-configuring localization systems. In: Proceedings of the Sixth International Symposium on Communication Theory and Applications, ISCTA 2001 (2001)Google Scholar
  5. 5.
    Carle, J., Simplot-Ryl, D.: Energy-efficient area monitoring for sensor networks. Computer 37(2), 40–46 (2004)CrossRefGoogle Scholar
  6. 6.
    Chandra, R., et al.: Adaptive Topology in Hybrid Wireless Networks,
  7. 7.
    Chlamtac, I., Conti, M., Liu, J.J.-N.: Mobile ad hoc networking: imperatives and challenges. Ad-hoc Networks Journal 1(1), 13–64 (2003)CrossRefGoogle Scholar
  8. 8.
    Chen, W., Jain, N., Singh, S.: ANMP: Ad hoc network management protocol. IEEE Journal on Selected Areas in Communications 17(8), 1506–1531 (1999)CrossRefGoogle Scholar
  9. 9.
    Das, B., Bhargavan, V.: Routing in Ad Hoc Networks Using Minimum connected dominating Sets. In: IEEE International Conference on Communications ICC 1997 (June 1997)Google Scholar
  10. 10.
    Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a virtual backbone. In: Proc. IEEE, IC3N 1997 (1997)Google Scholar
  11. 11.
    Deb, B., Bhatnagar, S., Nath, B.: STREAM: Sensor Topology Retrieval at Multiple Resolutions, Computer Science Dept. Rutgers UniversityGoogle Scholar
  12. 12.
    Deb, B., Bhatnagar, S., Nath, B.: A topology discovery algorithm for sensor networks with applications to network management. In: Proceedings of the IEEE CAS Workshop on Wireless Communications and Networking, Pasadena, USA (September 2002)Google Scholar
  13. 13.
    Deb, B., Bhatnagar, S., Nath, B.: Multi resolution state retrieval in sensor networks. In: Proceedings of International Workshop on Sensor Network Protocols and Applications, SNPA (2003)Google Scholar
  14. 14.
    Ephremides, A., Wieselthier, J.E., Baker, D.J.: A design concept for trliable mobile radio networks with frequency hopping signaling. Proceeding of IEEE 75(1), 56–73 (1987)CrossRefGoogle Scholar
  15. 15.
    Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., Wicker, S.: Large-scale Network Discovery: Design Tradeoffs in Wireless Sensor Systems, student poster presented at the 18th ACM Symposium on Operating System Principles, Banff, Canada (October 2001)Google Scholar
  16. 16.
    Gerharz, M., Waal, C.D., Martini, P.: A Cooperative Nearest Neighbors Topology Control Algorithm for Wireless Ad Hoc Networks. In: IEEE ICCCN 2003, Dallas, TX (2003)Google Scholar
  17. 17.
    Gerla, M., Tsai, J.T.C.: Multi cluster, mobile, multimedia radio networks. ACM J. Wireless Networks 1(3), 255–265 (1995)CrossRefGoogle Scholar
  18. 18.
    Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. In: European Symposium on Algorithm, pp. 179–193 (1996)Google Scholar
  19. 19.
    Haas, Z.J., Deng, J., Liang, B., Papadimitratos, P., Sajama, S.: Wireless Ad Hoc Networks. In: Proakis, J. (ed.) Encyclopedia of Telecommunications, John Wiley, Chichester (2002)Google Scholar
  20. 20.
    Jennings, E., Okino, C.: Topology control for efficient information dissemination in ad-hoc networks. In: 2002 Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2002), San Diego, CA, July 14-18 (2002)Google Scholar
  21. 21.
    Krishnamachari, B., Sitharama Iyengar, S.: Efficient and Fault-tolerant Feature Extraction in Sensor Networks. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 488–501. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  22. 22.
    Li, N., Hou, J.C.: Topology Control in Heterogeneous Wireless Networks: Problems and Solutions. In: IEEE INFOCOM 2004, Hong Kong (March 2004)Google Scholar
  23. 23.
    Li, X.Y., Wan, P.-J., Wang, Y., Yi, C.W.: Fault Tolerant Deployment and Topology Control in Wireless Networks. In: Proc. 4th ACM Intl. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), Annapolis, MD (2003)Google Scholar
  24. 24.
    McGlynn, M., et al.: Birthday protocols for Low Energy Deployment and Flexible Neighbor Discovery in Ad Hoc Networks. In: MobiHoc, LongBeach, CA (2001)Google Scholar
  25. 25.
    Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: ACM MOBICOM 1999 (August 1999)Google Scholar
  26. 26.
    Jianping Pan, Y., Hou, T., Cai, L., Shi, Y., Shen, X.: Topology control for wireless sensor networks. In: Proceedings of the 9th annual international conference on Mobile computing and networking, San Diego, CA, USA, pp. 286–299 (2003)Google Scholar
  27. 27.
    R. Choudhury, R., Bandyopadhyay, S., Paul, K.: A Distributed Mechanism for Topology Discovery in Ad hoc Wireless Networks using Mobile Agents. In: Proc. of Workshop On Mobile Ad Hoc Networking & Computing, MOBIHOC 2000 (2000)Google Scholar
  28. 28.
    Tim, N., Johann, H.: Local, Distributed Topology Control for Large-Scale Wireless Ad-Hoc Networks. In: International workshop and wirelesses hoc networks, University of Twente, Netherlands (2004),
  29. 29.
    Zhou, C., Krishnamachari, B.: Localized Topology Generation Mechanisms for Self-Configuring Sensor Networks. In: IEEE Globecom, San Francisco (December 2003)Google Scholar
  30. 30.
    A Topology Discovery for Sensor Networks with Application to Network Management,

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mahdi Nasrullah Al-Ameen
    • 1
  1. 1.Bangladesh University of Engineering and TechnologyDhakaBangladesh

Personalised recommendations