Secured Localized Broadcasting in Wireless Ad-Hoc Networks

α
kumarappan.auniv
kumarappan.auniv
σ
Geethu Chandran
Geethu Chandran
ρ
Jenopaul.P
Jenopaul.P
α Noorul Islam University

Send Message

To: Author

Secured Localized Broadcasting in Wireless Ad-Hoc Networks

Article Fingerprint

ReserarchID

CSTNWSB1H18

Secured Localized Broadcasting in Wireless Ad-Hoc Networks Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

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.

References

10 Cites in Article
  1. M Garey,D Johnson (1990). Computers and Intractability: A Guide to the Theory of NP-Completeness.
  2. B Clark,C Colbourn,D Johnson (1990). Unit Disk Graphs.
  3. Wang Lin-Zhu;,Fan Ya-Qin;,Yang Yang,; Shan,Min (2010). Heuristic Algorithm Based On Flooding Structure In Wireless Ad-Hoc Networks.
  4. M Al Amin,S Barua,S Vhaduri,A Rahman (2009). Load Aware Broadcast in Mobile Ad Hoc Networks.
  5. Majid Khabbazian,Vijay Bhargava (2007). Reducing Broadcast Redundancy in Wireless Ad Hoc Networks.
  6. Zhong-Yi Liu,Jin-Guo Zhou,Tong Zhao,Wei Yan (2009). An Opportunistic Approach to Enhance the Geographical Source Routing Protocol for Vehicular Ad Hoc Networks.
  7. S Revathi,T Rangaswamy (2012). Efficient route discovery using stable connected Dominating Set for mobile ad hoc networks.
  8. Jahangir Kheyrihassankandi,Yashwant Singh,Chin Kuan Ho (2012). A distributed algorithm for constructing minimum connected dominating set in mobile wireless network.
  9. Shenyong Gao,Ying Zhang (2012). An improved distributed approximation algorithm for minimum connected dominating set.
  10. Guodong Wang,Gang Wang (2009). An Energy-Aware Geographic Routing Algorithm for Mobile Ad Hoc Network.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

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): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

June 20, 2013

Language
en
Experiance in AR

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.

Read in 3D

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.

Article Matrices
Total Views: 9634
Total Downloads: 2550
2026 Trends
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Secured Localized Broadcasting in Wireless Ad-Hoc Networks

Geethu Chandran
Geethu Chandran
Jenopaul.P
Jenopaul.P

Research Journals