63 results for “Routing Overhead”

Set a search alert

Research ArticleOpen accessIn the abstractAn Adaptive Routing Algorithm for Ad hoc Mobile NetworksHamed S. Al-BdourThis research has examined the issues of routing in multi-hop wireless networks of mobile nodes without the need for any existing network infrastructure or administration. This is called ad hoc. The key point of this research article are selecting routing protocols which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 6,692 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordFuzzy Based Secure Data Aggregation Technique in Wireless Sensor NetworksD. HevinRajesh, B. ParamasivanProblem statement: Secure data aggregation is a challenging task in wireless sensor network due to the facts like more complexity, greater overhead in the case of cryptographic techniques. These issues need to be overcome using efficient technique. Approach: We propose a fuzzy based secure data aggregation technique which was having 3 phases. In its first phase, it performs clustering and … …Journal of Computer Science, Vol. 8, Issue 6 · 17 Mar 2012 · 7,252 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordSimulation of the Enhanced Associativity Based Routing Protocol for Mobile Ad Hoc Networks (MANET)Ayman Mansour Murad, Bassam Al-MahadeenThe simulations results showed that the overall EABR enhancement, when compared with ABR, in terms of communication overhead was ranging from 36% to 56%. While the overall EABR enhancement in terms of number of operation required to reconstructing the route was ranging from 36% to 55%. These enhancements were contributed to the novel way in route reconstructing introduced by EABR. …Journal of Computer Science, Vol. 3, Issue 6 · 30 Jun 2007 · 6,957 accessesView PDF Cite