Search for: [Keywords = "ad hoc"]

The Essence and Mechanisms of Ad Hoc Democracy

Studia Socjologiczne | 2010 | No 2 | 11-30

Keywords political decisions democracy media rationality ad hoc democracy

Download PDF Download RIS Download Bibtex

Abstract

The article presents a particular mechanism of political decision making in contemporary democratic systems. It is called here ‘ad hoc democracy’. This notion refers to the phenomenon of making political decisions (that are general and abstract) on the basis of premises that are individual and situational. After defining ad hoc democracy, the author reconstructs a typical scenario of the phenomenon, demonstrates selected examples of ad hoc democracy and discusses its main consequences. The analysis of ad hoc democracy construction process follows. The main cause of ad hoc democracy is defined as the interference of internally inconsistent logic of actions taken by three types of actors in political sphere: media, society (treated as an audience) and political decision-makers. In the last part of the article it is hypothesized that the systems experiencing rapid social changes and democratization processes are particularly prone to the emergence of ad hoc democracy. The hypothesis is justifi ed and substantiated by referring to an example of Poland during the systemic transformation process.

Go to article

Authors and Affiliations

Wiktor Szewczak

A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors

Karol Rydzewski Jerzy Konorski

International Journal of Electronics and Telecommunications | 2020 | vol. 66 | No 1 | 193-199 | DOI: 10.24425/ijet.2020.131863

Keywords ad hoc networks reputation errors

Download PDF Download RIS Download Bibtex

Abstract

A novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.

Go to article

Authors and Affiliations

Karol Rydzewski

Jerzy Konorski

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

Sahar Ebadinezhad

International Journal of Electronics and Telecommunications | 2021 | vol. 67 | No 1 | 13-22 | DOI: 10.24425/ijet.2021.135938

Keywords Ad hoc On-Demand Distance Vector Routing Clustering Internet of vehicles Vehicul

Download PDF Download RIS Download Bibtex

Abstract

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency and enhanced reliable connectivity. In this regard, for monitoring and controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur in the topology often leads to major challenges in IoVs, such as dynamic topology changes, shortest routing paths and also scalability. One of the best solutions for such challenges is “clustering”. This study focuses on IoVs’ stability and to create an efficient routing protocol in dynamic environment. In this context, we proposed a novel algorithm called Cluster-based enhanced AODV for IoVs (AODV-CD) to achieve stable and efficient clustering for simplifying routing and ensuring quality of service (QoS). Our proposed protocol enhances the overall network throughput and delivery ratio, with less routing load and less delay compared to AODV. Thus, extensive simulations are carried out in SUMO and NS2 for evaluating the efficiency of the AODV-CD that is superior to the classic AODV and other recent modified AODV algorithms.

Go to article

Authors and Affiliations

Sahar Ebadinezhad

1

Department of Computer Information System, Near East University. Nicosia TRNC, Mersin 10, Turkey

An Authenticated Routing Protocol for Wireless Ad Hoc Network Based on Small World Model

Daxing Wang Leying Xu

International Journal of Electronics and Telecommunications | 2021 | vol. 67 | No 3 | 425-430 | DOI: 10.24425/ijet.2021.137829

Keywords small world model wireless Ad Hoc network routing protocol AODV protocol authentication theory

Download PDF Download RIS Download Bibtex

Abstract

Compared with traditional cellular networks, wireless ad hoc networks do not have trusted entities such as routers, since every node in the network is expected to participate in the routing function. Therefore, routing protocols need to be specifically designed for wireless ad hoc networks. In this work, we propose an authenticated routing protocol based on small world model (ARSW). With the idea originating from the small world theory, the operation of the protocol we proposed is simple and flexible. Our simulation results show the proposed ARSW not only increases packet delivery ratio, but also reduces packet delivery delay. In particularly, Using authentication theory, the proposed ARSW improves communication security.

Go to article

Bibliography

[1] Elizabeth M. Royer, Chai-Keong Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 6(2): 46-55, 1999.
[2] Jorge E. O. T., Molina J. L. B., Miguel A. S. L. Simulation and evaluation of ad hoc networks under different mobility models. Ingeniería E Investigación, 23(3): 44-50, 2003.
[3] Tianbo L., Hao C. Anonymous routing protocols for mobile ad-hoc networks. International Journal of Security and its Applications, 10(4): 229-240, 2016.
[4] Banala R., Sakthivel M. A review on delay-minimized routing protocol in mobile cognitive ad hoc networks. International Journal of Computer Sciences & Engineering, 6(7): 991-996, 2018.
[5] Prabhavat S. , Narongkhachavana W. , Thongthavorn T. , et al. Low Overhead Localized Routing in Mobile Ad Hoc Networks. Wireless Communications & Mobile Computing, 2019, 6(4): 1-15.
[6] Shanmugasundaram D. , Shanavas A. R. M. Avoidance Cosmic Dust implementing in Ad Hoc on-demand Distance Vector (CDA AODV) Routing Protocol [J]. International Journal of Computer Sciences & Engineering, 2019, 7(4): 995-1005.
[7] Kothandaraman D., Chellappan C., . Energy Efficient Node Rank-Based Routing Algorithm in Mobile Ad-Hoc Networks. International Journal of Computer Networks & Communications, 2019, 11(1):45-61.
[8] Shanmugasundaram D., Shanavas A. R. M. . Avoidance Cosmic Dust implementing in Ad Hoc on-demand Distance Vector (CDA AODV) Routing Protocol. International Journal of Computer Sciences & Engineering, 2019, 7(4):995-1005.
[9] Kim, C., Talipov, E., & Ahn, B. A reverse aodv routing protocol in ad hoc mobile networks. Lecture Notes in Computer Science, pp. 522-531. 2016.
[10] Navjot K., Ashok K., & Daviet J. (2011). Comparison and analysis of RREQ and RREP for dynamic wireless network. Indian Journal of Computer Science & Engineering, 2(3), 73-78, 2011.
[11] Kargl F., Schlott S. & Weber M. (2004). Securing ad hoc routing protocols, Proceedings. 30th Euromicro Conference, 2004., Rennes, France, pp. 514-519.
[12] Kumar S., Dhull K., Sharma D., et al. Evaluation of AODV and DYMO Routing Protocol using Generic, Micaz and Micamotes Energy Conservation Models in AWSN with Static and Mobile Scenario [J]. Scalable Computing, 2019, 20(4):653-661.
[13] Watts D.J. & Strogatz S.H. (1998), Collective dynamics of ‘small-world’ networks, Nature, 1998, 393(6684): 440–442.
[14] Qin Y , Guo D , Luo L , et al. Design and optimization of VLC based small-world data centers [J]. Frontiers of Computer Science in China, 2019, 13(5):1034-1047.
[15] Qiu T.p, Liu X., Li K., et al. Community-Aware Data Propagation with Small World Feature for Internet of Vehicles [J]. IEEE Communications Magazine, 2018, 56(1):86-91.
[16] Reka A., Hawoong J., & Albert-Laszlo B. Error and attack tolerance of complex networks. Nature. 406(6794):378-382, 2004.
[17] Guidoni, D. L. , Mini, R. A. F. , & Loureiro, A. A. F. On the design of resilient heterogeneous wireless sensor networks based on small world concepts. Computer Networks, 54(8):1266-1281, 2009.
[18] Zhang, J. & Elkashlan M., A small world network model for energy efficient wireless networks, IEEE Communication. Lett., 17(10): 1928–1931, 2013.
[19] Zarepour, M., Universal and non-universal neural dynamics on small world connectomes: A finite-size scaling analysis. Physical Review E. 100 (5): 52138, 2019.
[20] Tefan G. Small directed strongly regular graphs. Algebra Colloquium, 27(1), 11-30, 2020.
[21] Zhang L. & Tang Y. Research on the method of improving network security based on small world model. 40(13):136-139, 2005.
[22] Oscar P. Sarmiento, F. G. Guerrero, D. R.(2008) Basic security measures for IEEE 802.11 wireless networks. Ingenieria E Investigación, 28(2):89-96. 2008.
[23] Wu J. &Yang S. Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks. IEEE Trans. on Parallel and Distributed Systems, 18(6): 735-748, 2007.
[24] Anhong Zhong. Research on Mobile Ad Hoc Network Routing Protocol Based on Small World Theory [D]. Xidian University, 2011.
[25] Li Yong, Li Wei, Zhao Weiquan, Optimization for Dynamic Source Routing Based on the Small-world Theory [J], Computer Engineering, 2005 (9):102-104.

Go to article

Authors and Affiliations

Daxing Wang

1

Leying Xu

1

College of Mathematics and Finance, Chuzhou University

Θ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks

Mohammed El Khattabi Jelloul Elmesbahi Ahmed Errami and Omar Bouattane Mohammed Khaldoun

International Journal of Electronics and Telecommunications | 2020 | vol. 66 | No 3 | 521-527 | DOI: 10.24425/ijet.2020.134008

Keywords Cluster-based networks Cluster head selection Ad-hoc networks Wireless sensors networks SDR USRP Simulink

Download PDF Download RIS Download Bibtex

Abstract

This paper details a hardware implementation of a distributed Θ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks in a constant time regardless the number of devices in the same cluster. The algorithm allows each device to automatically detect its own status; master or slave; based on identifier without adding extra overheads or exchanging packets that slow down the network. We propose a baseband design that implements algorithm functions and we detail the hardware implementation using Matlab/Simulink and Ettus B210 USRP. Tests held in laboratory prove that algorithm works as expected.

Go to article

Authors and Affiliations

Mohammed El Khattabi

Jelloul Elmesbahi

Ahmed Errami and Omar Bouattane Mohammed Khaldoun

Blockchain System for Secure and Efficient UAV-to-Vehicle Communication in Smart Cities

Suganthi Evangeline Ashmiya Lenin Vinoth Babu Kumaravelu

International Journal of Electronics and Telecommunications | 2023 | vol. 69 | No 1 | 133-138 | DOI: 10.24425/ijet.2023.144342

Keywords blockchain technology elliptic curve digital signature algorithm (ECDSA-192) intelligent transportation system (ITS) smart contract unmanned aerial vehicle (UAV) securehash algorithm (SHA) vehicular ad hoc network (VANET)

Download PDF Download RIS Download Bibtex

Abstract

In a smart city environment, Intelligent Transportation System (ITS) enables the vehicle to generate and communicate messages for safety applications. There exists a challenge where the integrity of the message needs to be verified before passing it on to other vehicles. There should be a provision to motivate the honest vehicles who are reporting the true event messages. To achieve this, traffic regulations and event detections can be linked with blockchain technology. Any vehicle violating traffic rules will be issued with a penalty by executing the smart contract. In case any accident occurs, the vehicle nearby to the spot can immediately send the event message to Unmanned Aerial Vehicle (UAV). It will check for its credibility and proceed with rewards. The authenticity of the vehicle inside the smart city area is verified by registering itself with UAVs deployed near the city entrance. This is enabled to reduce the participation of unauthorized vehicles inside the city zone. The Secure Hash Algorithm (SHA256) and Elliptic Curve Digital Signature Algorithm (ECDSA-192) are used for communication. The result of computation time for certificate generation and vehicles involvement rate is presented.

Go to article

Authors and Affiliations

Suganthi Evangeline

1

Ashmiya Lenin

2

Vinoth Babu Kumaravelu

3

Department of Electronics and Communication Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India
PG Scholar in Communication Systems, Karunya Institute of Technology and Sciences, Coimbatore, India
School of Electronics Engineering, VIT University, Vellore, India

Search results

Filters

Search results

The Essence and Mechanisms of Ad Hoc Democracy

Abstract

Authors and Affiliations

A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors

Abstract

Authors and Affiliations

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

Abstract

Authors and Affiliations

An Authenticated Routing Protocol for Wireless Ad Hoc Network Based on Small World Model

Abstract

Bibliography

Authors and Affiliations

Θ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks

Abstract

Authors and Affiliations

Blockchain System for Secure and Efficient UAV-to-Vehicle Communication in Smart Cities

Abstract

Authors and Affiliations