Article Fingerprint
ReserarchID
CSTNWSB1H18
Broadcasting, one of the fundamental operations of the wireless ad-hoc networks, can be implemented using two approaches i.e static and dynamic. In broadcasting a node disseminates a message to all other nodes within the network. Usually in static approach the forwarding or non-forwarding status of the node is determined by a globally known priority function and local topology information. The static approach can achieve a constant approximation factor to optimal solution only if position information is available which is not possible in all cases. This paper shows that constant approximation to optimal solution can be obtained using connectivity information only. The status of each node is determined ‘on-the-fly’ i.e while the broadcasting process is being done. This local broadcast algorithm can achieve both full delivery and constant approximation to the optimal solution. The security issues can be solved by comparing the expected and perceived packet delivery ratios.
kumarappan.auniv. 2013. \u201cSecured Localized Broadcasting in Wireless Ad-Hoc Networks\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E8): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: India
Subject: Global Journal of Computer Science and Technology - E: Network, Web & Security
Authors: Geethu Chandran, Jenopaul.P (PhD/Dr. count: 0)
View Count (all-time): 271
Total Views (Real + Logic): 9634
Total Downloads (simulated): 2550
Publish Date: 2013 06, Thu
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Broadcasting, one of the fundamental operations of the wireless ad-hoc networks, can be implemented using two approaches i.e static and dynamic. In broadcasting a node disseminates a message to all other nodes within the network. Usually in static approach the forwarding or non-forwarding status of the node is determined by a globally known priority function and local topology information. The static approach can achieve a constant approximation factor to optimal solution only if position information is available which is not possible in all cases. This paper shows that constant approximation to optimal solution can be obtained using connectivity information only. The status of each node is determined ‘on-the-fly’ i.e while the broadcasting process is being done. This local broadcast algorithm can achieve both full delivery and constant approximation to the optimal solution. The security issues can be solved by comparing the expected and perceived packet delivery ratios.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.