When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Abstract The Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based Medium Access Control (MAC) protocol uses a short request-to-send (RTS) and clear-to-send (CTS) control packets prior of actual data packet transmission. The function of the CSMA/CA based MAC protocol in wireless communication is to facilitate wireless nodes (i.e. laptop, PC, smart phones and etc) to access a wireless medium efficiently. Besides, it is also efficiently manage the wireless medium when more wireless nodes involving in transmission activity in the network. This protocol allows all wireless nodes in the network to communicate between each other without collision. Since collisions may only occurred on the RTS control packets thus it can reduce the actual data collision on the medium. The RTS/CTS control handshake provides better performance and reduce the duration of collision especially when long data packets are transmitted over wireless medium. However, even though the CSMA/CA based MAC protocol working effectively and provides better throughput performance over single hop communication but it performance degrade significantly when directly applied in multihop Wireless Mesh Network (WMN). The reason behind this poor performance is due to the inefficient packet delivery of CSMA/CA based MAC protocol in multihop network. The exchange of RTS and CTS signaling that required at each hop throughout the multihop network eventually will cause the large overheads and subsequently degrade network throughput. Therefore, in this paper, an enhancement of RTS/CTS handshake has been proposed in order reduces the signaling overheads and ultimately allows a smooth packet delivery in the multihop network without any collision. In this work, the multihop network performances are evaluated analytically in terms of throughput and overhead. It is proven that the new method of RTS/CTS handshake provides significant improvement in throughput and overhead. Keywords: Medium Access Control (MAC) protocol; Signaling; Overheads; Multihop communication
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Abstract The Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based Medium Access Control (MAC) protocol uses a short request-to-send (RTS) and clear-to-send (CTS) control packets prior of actual data packet transmission. The function of the CSMA/CA based MAC protocol in wireless communication is to facilitate wireless nodes (i.e. laptop, PC, smart phones and etc) to access a wireless medium efficiently. Besides, it is also efficiently manage the wireless medium when more wireless nodes involving in transmission activity in the network. This protocol allows all wireless nodes in the network to communicate between each other without collision. Since collisions may only occurred on the RTS control packets thus it can reduce the actual data collision on the medium. The RTS/CTS control handshake provides better performance and reduce the duration of collision especially when long data packets are transmitted over wireless medium. However, even though the CSMA/CA based MAC protocol working effectively and provides better throughput performance over single hop communication but it performance degrade significantly when directly applied in multihop Wireless Mesh Network (WMN). The reason behind this poor performance is due to the inefficient packet delivery of CSMA/CA based MAC protocol in multihop network. The exchange of RTS and CTS signaling that required at each hop throughout the multihop network eventually will cause the large overheads and subsequently degrade network throughput. Therefore, in this paper, an enhancement of RTS/CTS handshake has been proposed in order reduces the signaling overheads and ultimately allows a smooth packet delivery in the multihop network without any collision. In this work, the multihop network performances are evaluated analytically in terms of throughput and overhead. It is proven that the new method of RTS/CTS handshake provides significant improvement in throughput and overhead. Keywords: Medium Access Control (MAC) protocol; Signaling; Overheads; Multihop communication
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
This document summarizes a research paper that proposes a new routing algorithm called Quadrant-Based Directional Routing (Q-DIR) for multihop wireless networks. Q-DIR is implemented as a cross-layer with Contention Window Adaptation Mechanism (CWAM) to reduce network power consumption and increase throughput. Q-DIR limits flooding to the quadrant containing the source and destination nodes. CWAM adapts the contention window size based on node traffic to improve throughput. Simulation results show that Q-DIR with CWAM outperforms standard flooding protocols by utilizing fewer nodes and increasing throughput while reducing power consumption.
A distributed three hop routing protocol to increase the capacity of hybrid w...Pvrtechnologies Nellore
This document presents a new routing protocol called Distributed Three-hop Routing (DTR) for hybrid wireless networks. DTR aims to increase network capacity and scalability by taking advantage of widespread base stations. It divides message streams into segments and transmits them in a distributed three-hop manner, with at most two hops using high-speed ad-hoc interfaces and one hop using cellular interfaces. This reduces overhead, congestion, and improves reliability compared to existing protocols. Theoretical analysis and simulations show DTR achieves superior throughput, scalability, and mobility resilience over other routing protocols.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Energy Minimization in Wireless Sensor Networks Using Multi Hop TransmissionIOSR Journals
This document discusses energy minimization in wireless sensor networks using multi-hop transmissions. It provides background on wireless sensor networks and their components. It then discusses challenges like limited energy and the need for multi-hop transmissions due to limited transmission range. The document outlines the problem of determining the optimal number of cooperating nodes per hop to minimize total energy consumption while meeting an outage probability requirement at each hop. It discusses using cooperative transmissions to increase transmission range through diversity gain while keeping transmit power fixed.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
The document proposes a Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. CPCRT aims to distinguish between packet loss due to link failure versus other causes like congestion. It takes a cross-layer approach using information from the physical, MAC, and application layers. The proposed method also aims to conserve power during packet transmission by adjusting transmission power levels based on received signal strength. Simulation results show that CPCRT can better utilize resources and conserve power during congestion control compared to other approaches.
CPCRT: Crosslayered and Power Conserved Routing Topology for congestion Cont...IOSR Journals
The document describes a proposed Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. The CPCRT aims to improve transmission performance by distinguishing between packet loss due to link failure versus other causes, while also conserving power used for packet transmission. It builds upon an earlier Crosslayered Routing Topology (CRT) approach by incorporating power conservation. The CPCRT is intended to identify the root cause of packet loss, avoid unnecessary congestion handling from link failures, allow congestion handling at specific high-traffic nodes rather than all nodes, and optimize resource and power usage for packet routing in mobile ad hoc networks.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
More Related Content
Similar to BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
This document summarizes a research paper that proposes a new routing algorithm called Quadrant-Based Directional Routing (Q-DIR) for multihop wireless networks. Q-DIR is implemented as a cross-layer with Contention Window Adaptation Mechanism (CWAM) to reduce network power consumption and increase throughput. Q-DIR limits flooding to the quadrant containing the source and destination nodes. CWAM adapts the contention window size based on node traffic to improve throughput. Simulation results show that Q-DIR with CWAM outperforms standard flooding protocols by utilizing fewer nodes and increasing throughput while reducing power consumption.
A distributed three hop routing protocol to increase the capacity of hybrid w...Pvrtechnologies Nellore
This document presents a new routing protocol called Distributed Three-hop Routing (DTR) for hybrid wireless networks. DTR aims to increase network capacity and scalability by taking advantage of widespread base stations. It divides message streams into segments and transmits them in a distributed three-hop manner, with at most two hops using high-speed ad-hoc interfaces and one hop using cellular interfaces. This reduces overhead, congestion, and improves reliability compared to existing protocols. Theoretical analysis and simulations show DTR achieves superior throughput, scalability, and mobility resilience over other routing protocols.
This document describes a routing protocol designed for reliable and efficient communication in wireless sensor networks (WSNs). It discusses four existing routing protocols - Gradient-Based Routing (GBR), Gradient Broadcast (GRAB), Dynamic Source Routing (DSR), and Adhoc On-demand Distance Vector Routing (AODV) - and analyzes their performance tradeoffs. It then proposes a new light-weight routing protocol called Efficient and Reliable routing (EAR) that aims to achieve reliable and efficient routing in single-hub and multi-hub WSNs while minimizing energy consumption and communication overhead. The protocol design and operation are explained in detail.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
A QoS Based MAC Protocol For Wireless Ad-hoc NetworkIJNSA Journal
Multimedia communication over wireless Ad-hoc networks has become the driving technology for many of the important applications, experiencing dramatic market growth and promising revolutionary experiences in personal communication, gaming, entertainment, military, security, environment monitoring, and more. The advances in wireless communications and growth of real-time applications have necessitated the development of wireless networks that can support high Quality of Service (QoS) and power control. A node in an ad hoc network is normally battery operated which poses a huge constraint on the power consumption of such a node. Hence, designing a power efficient MAC protocol for ad hoc wireless networks is a major challenge. In this paper, we propose a CDMA based power controlled medium access protocol for mobile and ad hoc network (MNA). The protocol conserves power and provides QoS guarantees for multimedia traffics. In that network one of the fundamental challenger in MANETs is how to increase the overall network throughputs well as reading the delay while maintaining how energy consumption for packet processing in communication. simulation results shows that the performance of the protocol with increase in traffic while QoS is better in terms of Energy consumption, throughput, & communication delay than existing protocol.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Energy Minimization in Wireless Sensor Networks Using Multi Hop TransmissionIOSR Journals
This document discusses energy minimization in wireless sensor networks using multi-hop transmissions. It provides background on wireless sensor networks and their components. It then discusses challenges like limited energy and the need for multi-hop transmissions due to limited transmission range. The document outlines the problem of determining the optimal number of cooperating nodes per hop to minimize total energy consumption while meeting an outage probability requirement at each hop. It discusses using cooperative transmissions to increase transmission range through diversity gain while keeping transmit power fixed.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
The document proposes a Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. CPCRT aims to distinguish between packet loss due to link failure versus other causes like congestion. It takes a cross-layer approach using information from the physical, MAC, and application layers. The proposed method also aims to conserve power during packet transmission by adjusting transmission power levels based on received signal strength. Simulation results show that CPCRT can better utilize resources and conserve power during congestion control compared to other approaches.
CPCRT: Crosslayered and Power Conserved Routing Topology for congestion Cont...IOSR Journals
The document describes a proposed Crosslayered and Power Conserved Routing Topology (CPCRT) for congestion control in mobile ad hoc networks. The CPCRT aims to improve transmission performance by distinguishing between packet loss due to link failure versus other causes, while also conserving power used for packet transmission. It builds upon an earlier Crosslayered Routing Topology (CRT) approach by incorporating power conservation. The CPCRT is intended to identify the root cause of packet loss, avoid unnecessary congestion handling from link failures, allow congestion handling at specific high-traffic nodes rather than all nodes, and optimize resource and power usage for packet routing in mobile ad hoc networks.
Similar to BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS (20)
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
The CBC machine is a common diagnostic tool used by doctors to measure a patient's red blood cell count, white blood cell count and platelet count. The machine uses a small sample of the patient's blood, which is then placed into special tubes and analyzed. The results of the analysis are then displayed on a screen for the doctor to review. The CBC machine is an important tool for diagnosing various conditions, such as anemia, infection and leukemia. It can also help to monitor a patient's response to treatment.
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Manufacturing Process of molasses based distillery ppt.pptx
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
DOI:10.5121/ijcnc.2023.15202 21
BROADCAST SCHEDULING PROTOCOLS IN MULTI-
HOP MOBILE AD HOC NETWORKS
Chandra Kanta Samal
Department of Comp.Sc., ANDC, Delhi University, New Delhi, India
ABSTRACT
When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
KEYWORDS
Broadcast latency problems; Efficiency; Reachability; Reliability; Average latency etc.
1. INTRODUCTION
A mobile ad hoc network is a group of wireless mobile phones forming a provisional set-up does
not include support of any centralized administration. If the source node cannot directly send a
message to destination node because of wireless nodes have limited transmission range. So, the
source node forwards a message through intermediary nodes towards the destination node. Thus,
a multi-step situation happens, and a packet may need to be relayed by several nodes before it
reaches its destination [1, 2]. The major problems in MANETs are battery powered, interference,
security, bandwidth, and reliability. Due to the mobility of nodes, the network's properties are
unpredictable; its topology changes and the signal strength varies with the environment and time
[3, 4].Consequently, communication pathways are divided up and new routes are generated
dynamically [5].
For reliable communication in an ad hoc mobile network, the broadcast algorithm is crucial. [6,
7]. Many contentions, redundancy, rebroadcasts, and collisions are different categories for the
issue. The flooding process produces a lot of redundant messages because, first, it is possible that
neighboring nodes have already received each node's retransmission of a message. Second, there
will be several nodes competing for access to the wireless channel since all nodes want to
rebroadcast the message at the same time or very close to it. Third, since the hidden terminal
problem will always exist, many collisions will happen even without the use of the RTS/CTS
exchange [8, 9].
2. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
22
2. EXITING RELATED WORKS
This section compares two broadcast protocol's performance in terms of efficiency and reliability
in multi-hop ad hoc networks in both highand low-density networks. The two broadcast protocols
are Delayed Flooding with Cumulative Neighborhood Protocol and Proposed Enhanced Generic
Self-Pruning Protocol. The Delayed Flooding with Cumulative Neighborhood (DFCN) Protocol
enables broadcasting on wide-area networks with excellent bandwidth management. It is made up
of many different wireless mobile devices, then create a network and we see the network’s
bandwidth of the channel is accurately used [10].Suppose we are increasing density of these
nodes within the network area, when packet transmission it does not exhaust way increased
bandwidth, it may decrease redundancy and rebroadcast there. The main aim of the DFCN
protocol is minimizing the number of emissions that’s result impact on improving the network
throughput and also route, selecting the path of nodes at maximizing coverage in the network
[10]. Basic method of DFCN algorithm is broadcasting messages in distributed mobile
unintended networks, message sent from source node to forward to any or all nodes within the
network. Here, the method of selecting the routing nodes is used. These nodes forward messages
to intermediate nodes, utilizing the least amount of the network as a result. This protocol will be
an enhanced version of that which is mentioned in [11].This protocol benefits the conservation of
energy in multi-hop unplanned mobile network. The difficulty of this protocol is that the desired
bandwidth cannot be transferred because of the high mobility of the nodes. The reliability of the
sparse network decreases when network size is increased. There is no system-wide traffic
monitoring if the size of the degree is increasing. The network does not communicate the
maximum quantity of data because low emission results from the algorithm’s node selection
technique.
Excessive network traffic may cause a significant delay in packet transmission if multiple hosts
must simultaneously compete for a finite amount of communication bandwidth. The genetic
algorithm is more powerful than other algorithms such as the results of the algorithm fulfill high
efficiency but low reliability [12].This algorithm's advantage is that it performs effectively with
low mobility. While certain algorithms are highly reliable, they are also inefficient, and vice
versa. The proposed enhanced generic self-pruning (PEGSP) algorithm's main objective is to
achieve high reliability in extreme mobile networks. This can be achieved by either increasing the
delivery ratio of a reliable algorithm or decreasing the number of forward nodes in an efficient
approach.
The "Hello Messages" technique was used by the proposed PEGSP algorithm to detect the high
mobility of nodes during route connection establishment, which eliminated the issue of
inadequate consideration of their capabilities. Additionally, the proposed PEGSP algorithm used a
different set of messages called location information messages and timers that were informed to
detect a link failure. The drawback of the algorithm is that when mobile node speeds increase,
network efficiency declines. The degree of node dependence is extremely high, and node
accessibility within the networks' transmission range is not always guaranteed. A Dynamic
scalable broadcast algorithm is a dynamic broadcast protocol and it is reliably in a MANET. The
exiting dynamic broadcast technique is not reliable in mobile ad hoc networks because of the
node's mobility and self-motivated topology changes its position in distributed mobile ad hoc
network. The existing protocol designs do not have better performance in the network. Author’s
purpose DSB algorithm is very good for slot assignments among nodes due to reduced
interference between nodes at the time of slot reservation. Our emphasis is on collision
avoidance, but on reducing the problems of redundancy, rebroadcasting and broadcast latency.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
23
3. TECHNICAL APPROACH
In a multi-hop Mobile Ad hoc Network, we have created broadcasting protocols for dependable
and spam-free communication. In this research, we suggest two novel broadcast protocols that
modify the Stable Reliable Broadcast Scheduling (SRBS) and Dynamic Scalable Broadcast
(DSB) algorithms. The SRBS is a static broadcast protocol; it is a higher performance in high
mobility and increasing network size [13].
In dynamic broadcast protocol nodes join and leave to each other’s within the network. The
Dynamic Scalable Broadcast Algorithm has no central computing managed; each node keeps the
state data record in its place. Every node makes this recording by gathering information from its
neighbors 1-hop and 2-hop stop. When the node communicates over the network, it detects the
node of its neighbors within the network. If a network node's neighbour is occupied, then the
sleep cycle repeats this process until the neighbor node in the network is busy otherwise node
would join the neighbor’s node in the network for process of registration. As we are using set
covering scheme, the node should know its 1-hop neighbors and the 2-hop coverage within the
network. In the set covering scheme, minimum 1-hop nodes require covering the 2-hop nodes in
the network and hence reduce rebroadcast and redundancy [14].
Figure 1. An example of three-layer graph [14]
In figure 1, when packets communicate in the multi-hop network collision of nodes may occur at
layer 3. The nodes "a", "b","c","d" and "e" in layer 1 and "l", "f", "g", "h", " i", "j" and "k" at
layer 2 is the source node's one-hop and two-hop neighbours, respectively, whenever the node "s"
in layer 0 is the only source node. The nodes "a", "c" and "e" in layer 1 could be the very
minimum required to cover all nodes in layer 2.For layer 2 has no common neighbours for nodes
"a”, "c" and "e", they will broadcast packetsat the same time without collision occur in layer 2.
So, we have got used the independent transmission plan to reduce collisions and broadcast
latency [14]. If the degree size of a node is increased within the network it will be unreliable for
communication. That's why the All to All protocols are used for slot allocation between mobile
nodes to regulate the overload of node and avoid queuing of node [14]. This approach may be
well worked in MANET, it helps for reliable communication in the multi-hop networks. We make
slot timers for a node to sense the neighbor node’s network. If the node is not detecting
neighbor’s node network within the slot time period, we have got to line the slot timer again.
Subsequently, if the source node does not detect the neighbor node’s network, it declares that
neighbor node’s network is out of transmission range. Every device chooses to send an
identifying packet. A new device must broadcast an ID Packet; If not, it remains in receive mode
onlyA recognizes a new neighbour when it receives an ID packet. At the time of the identification
interval, we use three slots as follows:
4. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
24
Request slot
Collision slot
Broadcast slot
The new node is introduced through the registration process, it identified to all or part of its
neighbors at 1 or 2-hops distance in the network. If more nodes ready to join the network are
located one or two hops away from the source node, only those nodes who successfully
completed the registration process should be permitted. The X Node reserves the broadcast slot,
if no one else has to join the network. If Node Y also wants to affix the registration process, it
should wait for an X node to complete the registration process successfully.
If X is a joining node, it detects an empty broadcast slot and sends the request control packet in
the request slot for the registration request. If X did not sense any collision in the network when
broadcasting its control packets. If X notices an empty collision slot, it knows that neither of its
neighbours within 1 or 2 hops is submitting a request to start the registration process. If the
registration process is successful, then are made frame schedule for 1-hop neighbors is created
otherwise sleep cycle is repeated and slot timers are made again until the registration process is
successful. In the final step we execute the frame schedule as collision free in the multi hop
network [15].
Neighbor Broadcast Coverage: TheAuthor follows the neighbor broadcast coverage method
purpose by reference [16, 17]: Let set Bm and Bn are the neighbor node, node n forwards the
messages to node m and Dm stand for neighbor set coverage up to two hops. The m node
receives a message from n node first time, so the neighbor set coverage broadcast follows:
Dm=Bm-Bn-{n}-----------------------------------------------------(1)
Reliable BroadcastPacket: The scalable broadcast algorithm has mentioned by reference [18].
We use to knowledge the two hops neighbor set coverage by equation (1).If n node is not
received message from m node, it is clear that m set is no neighbor coverage, on that situation m
set is not rebroadcast the packets then node n will delay the rebroadcast schedule. We consider
themaximum number of neighbor coverage nodes is a highest priority for broadcast packetas
comparison with those nodes is a covered minimum neighbor. Broadcast delay is calculated
noden’s degree (Cn) and its neighbor’s maximum degree (Cmax):
Dt (Delay Time) = Cmax/Cn-------------------------------------(2)
3.1. Flow Chart of DSBAlgorithm
The Dynamic Scalable Broadcast (DSB) algorithm flow chart is provided in this work.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
25
Detect Neighbors Node
in the Network
Neighbors Node in the
Network Busy
Sleep Cycle
Yes
Process For Registration
Making Slot Timers (Assign slot
Time Period)
Using Set Covering Scheme (1-hop
Neighbors and 2-hops coverage )
Using Independent Transmission
Scheme ( For Multi-hop
communication)
Using All to All protocol
(Slot allocation among Nodes)
No
Request Slot
Collision slot
free
Broadcast Slot
Free
Wait for collision slot
free
Sleep Cycle
No
Wait for Broadcast Slot
Free
Yes Yes
No
||*Nodes joined in the Network
|| * Minimum Nodes coverage
|| * Reduce Rebroadcast
|| * Reduce Redundant
|| * Avoid Collision
|| * Reduce Broadcast Latency
|| * Traffic Control
|| * Avoid Queuing
|| * Reduce Overload of Node
|| * Mobility Control
|| * Collision Control
2
1
Broadcast Slot For Reservation
Yes
Sleep Cycle
Run the Frame Schedule
Make Frame Schedule to 1-hop
Neighbors
Success Registration
Process
Yes
No
|| Success Registration
Process
|| Success Registration Process keep in the Frame
Schedule
|| Execute the Frame Schedule in Multi-hop MANET
1
2
Figure 2. DSB Algorithm’s Flow chart
6. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
26
3.2. Stable Reliable Broadcast Scheduling Algorithm’s Flow Chart.
The SRBS Algorithm flow chart is mentioned[13].
Detect
Neighbors Node
in the Network
Neighbors Node
in the Network
Busy
Sleep Cycle
Yes
Reduce the
interval of
“HELLO”
messages
No
Making Timers
Timer Expired at S and T
did not send “HELLO”
messages
Use 1-hop
Location
information at
node S
Yes
Broadcast
Neighbor
identification
Requests
No
Receive Neighbor
IDs in Transmission
Slices
New Neighbor
Detected
Yes
Finding 1-hop
location
Information T at S
Node T is
moving out the
1-hop of S
Inform All Nodes
Set timer again
Timer
Expired
Node T is
moving out the
1-hop of S
Inform All Nodes
No
Yes
Yes
No
No
1
7. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
27
Construct & Transmit a
Temporary
Polling Schedule
No
Neighbors Reply in Temporary
Slots with Scheduling Data
New Transmission Schedule
For 1-hop Neighborhood
Slot Allocation to 1-hop
Neighbors (Using the Reliable
Time Slot Allocation Among
Mobile Nodes Algorithm
Make Frame Schedule to 1-hop
Neighbors
Wait one Frame for 1-hop
Neighbors to Forward New
Schedule
1-hop Neighbors Message
Reception
When RAD Expiration Broadcast
Message M immediate emission
Reachibility=|r(m)|/|N(s)|
# Where r(m): The set of IDs that are known have received the messages referred to as r(m).
# N(s): The Set of Neighbors of the Node S by N(S).
(f(m)=Reachibility >= Min
Reachibility)
# f(m): The decision of whether the message should be forwarded or not .
Broadcast message
Dropped
Broadcast message
Forward
Wait one Frame for 2-hop
Neighbors to Forward
New Schedule
When node gets a
New Neighbor event
then (N(s)<Density
Threshold)
Rad(m) 0
Yes
# Density Threshold means , incoming message from the 1-hop Neighbors node. No
Yes
No
1
8. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
28
Flow chart of Reliable time slot allocation among mobile nodes[19].
S Source Node
S=0
Set_Cover=0
Num_OF_ITS=0
M1=E
M2=F
j=0
H=Nil
E →Set of 1-hop nodes from S
F → Set of 2-hop nodes from S
F≠0
Stop Slot Allocation
Add v to Set_Cover
Remove v from E
Remove Nodes є M(v) from F
Select a node vєE that maximizes the
size of |M(v)∩F|
No Yes
1
9. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
29
vєSet_Cover(Let v be the first node listed in set cover)
If v and every node in H(i) share
No common Neighbors in 2-hop Nodes
i=i+1
Num_OF_ITS=Num_OF_ITS+1
T= nil, j++, K=0
Add v to ITS(i)
i=0
Add v to ITS(Num_OF_ITS)
K=K+1
Choose the node
v in S
(|M(TU{v})|>|M(T)|)&&
(|M(TU{v})|>=|M(TU{u}))
Stop Slot Allocation
M(T)=M(T)+1
M2 Collision freely covered By T
S=S-v
T=TU{v}
No
Yes
No
Yes
1
3
2
|M(TU{v})|>|M(T)|
Stop Allocation
H=HU{T}
M2=M2-M(T)
Return(H)
No
Yes
2
3
Figure 3. Flow chart of SRBS Algorithm
10. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
30
4. SIMULATION AND RESULT ANALYSIS
We have compared the various metric’s simulation results of theSRBS, DFCN, DSB and PEGSP
methods; it is implemented in GloMoSim simulatorv2.03 [20,21,22]. We have got taken the
subsequent parameters within the configuration setup.
Table 1. Simulation Configuration setup parameters
Physical ground area 3000 * 3000m
Seed value 1
Time 600 seconds
TEMPRATURE 290.0
Edge 500m
Nodes varied 300 to 600
RADIO-BANDWIDTH 2mb/s
NOISE-FIGURE 10.0dB
Radio transmission power 10.0 dbm
Node placement RANDOM
MOBILITY-WP-MIN-SPEED 0
MOBILITY-WP-MAXI-SPEED 10m/s-240m/s
MAC-Protocol 802.11
MAX PACKET IN IFQ 50
MOBILITY-WP-PAUSE time period 10s
PROMISCUOUS-MODE NO
The throughput of the network with 150 nodes is displayed in figure 4 as a result.If we
consistently increase node speed, it starts at 20 m/s and goes up to 120 m/s then the four
algorithms throughput decreases because of the high speed of nodes. Therefore, DFCN algorithm
has low throughput and SRBS algorithm performs better than the other three algorithms.
Expression of the throughput:
Throughput= (∑P(mg)-∑Q(mg))/∑R(nbn)-----------------------------------------(3)
(Where P(mg)→ Sent the total Numberof transmission messages, Q(mg)→Number of neighbor
nodes received message, R(nbn)→ Total number of neighbor nodes)
Figure 4. Throughput Vs Mobility of Node (Size of node is 150)
11. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
31
Above figure 5result that when the size of nodes is 500, area is 3000 sq.m2 and speed of nodes is
30 m/s that time PEGSP algorithm results slightly less than the DFCN and DSB algorithms result.
If we are increasing regularly the network size and number of nodes, then the four algorithms
throughput will decrease. The SRBS algorithm is determined to be superior to the opposing three
algorithms.
Figure 5. Throughput Vs Network Size (sq.m2)
Figure 6. Reachability Vs Number of Nodes (Mobile node’s speed is 30 m/s)
The DSB algorithm is more reachable than the SRBS, DFCN and PEGSP algorithms, according
to the resulting extract from figure 6. Reachability of the DFCN algorithm is marginally better
than PEGSP algorithm at 500 nodes.
Reachability is determined by how many nodes have actually received broadcast packets.
Reachability = ∑Q(rp)/∑R(nd)--------------------------------------------------(4)
(Where Q(rp) → Actual no of nodes has received broadcast packets, R(nd) → Number of nodes
overall in the networks).
12. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
32
Figure 7. Rebroadcast Vs Number of Nodes (Node’s mobility is 30m/s)
Figure 7 demonstrates that the SRBS algorithm's simulation result is improved than the other
three algorithms because of rebroadcast ratio is minimum.
Rebroadcast Ratio=∑RT/∑TN-------------------------------------------------(5)
(Where RT → RT is that Actual number of nodes retransmitted packets, TN→The network's
total nodes are represented by the TN).
Figure 8. Average Latencies Vs Number of Nodes (Each Nodes Speed is 10m/s)
Below figure 8 graph shows that when we are increasing network size of nodes, then four
algorithm’s broadcast latencies result is increasing. Average broadcast latency means from the
interval time of the broadcast was started to destination host finishes at the time of rebroadcast.
The DSB algorithm has less average latency than compare DFCN, SRBS and PEGSP algorithms.
So, the DSB algorithm is a good performance because of minimum delay.
Rebroadcast Vs Number of Nodes
0
20
40
60
80
100
100 200 300 400 500 600
Number of Nodes
Rebroadcast(%) SRBS
DSB
DFCN
PEGSP
13. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
33
Figure 9. Reliability Vs Mobility (Size of nodes is 100)
In figure 9's outcome demonstrates that as node speeds increase from 0 to 240 m/s, the SRBS
algorithm is more reliable than the other three algorithms. Percentage number of node shas
received that broadcast of packets within the network we called reliability. It concludes that
SRBS algorithm’s result beyond other algorithms, but DFCN algorithm’s performance is
incredibly poor.
This figure 10 we have seen the efficiency level of SRBS algorithm is better, more other
algorithm’s results. In network percentage number of nodes forwarded the packets are called
Efficiency. The figure 10, if we are increasing each of the node’s speed is 30m/s then the DFCN
performance is slightly less of the PEGSP and DSB algorithm’s performance. Similarly, speed of
mobile nodes was increased from 30 to 60 m/s at that time DSB algorithms performance same as
PEGSP algorithm. So, as mobile node speed increases from 0 to 210 m/s on a regular basis, the
performance of the two methods degrades.
Figure 10. Efficiency Vs Mobility (Mobile Nodes size is 150)
Reliability Vs Mobility
0
25
50
75
100
0 30 60 90 120 150 180 210 240
Mobility(Mobility is measuredm/s)
Reliability(Delivery
Ratio
%)
SRBS
DSB
DFCN
PEGSP
Efficiency Vs Mobility
0
10
20
30
40
50
60
70
80
90
100
0 30 60 90 120 150 180 210
Mobility(Mobility is measured in m/s)
Efficiency(%)
SRBS
DSB
DFCN
PEGSP
14. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
34
Figure 11. Throughput Vs Transmission Range
(Size of nodes is 150 and mobility of nodes is 30 m/s)
The above figure 11SRBS algorithm contains good performance compare with the DSB, DFCN
and PEGSP algorithm’s result when varies in the different transmission ranges. After rising
transmission range up to 240m and each of the node’s speed is 30m/s, DFCN algorithm’s
performance remains the same as DSB algorithm but it is higher than the PEGSP algorithm.
From figure 12, If we regularly varying degree of nodes up to 120 then the DSB algorithm gives
higher throughput of DFCN,PEGSP and SRBS algorithms. So, the simulation graph DSB
algorithm is healthier.
Figure 12. Throughput Vs Degree of Nodes
(Node size is150 and node speed is 15m/s)
Throughput Vs Transmission Range
0
20
40
60
80
100
60 120 180 240 300 360
Transmission Range (Transmission Range measure in meter)
Throughput(Throughput
measured
in
bits
per
second)
SRBS
DSB
DFCN
PEGSP
Throughput Vs Degree of Nodes
0
10
20
30
40
50
60
70
80
90
100
15 30 45 60 75 90 105 120
Degree of Nodes
Throughput(Throughput
is
measured
in
bits
per
second)
SRBS
DSB
DFCN
PEGSP
15. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
35
Figure 13. Network Connectivity Rate Vs No of Nodes
In Figure 13, the network connectivity rate is decreased if we increase the number of nodes.
Thus, the SRBS algorithm produces better results than the other three algorithms.
Figure 14 compares the outputs of the four algorithms result. Performance is improved with the
SRBS algorithm. The collision rate likewise rises as packet size grows.
Figure 14. Collision Rate Vs No of Nodes
It shows from figure 15 that as node size increases, there is more delay for four algorithms. The
PEGSP algorithm is better than the DFCN algorithm up to a node size 100. When the number of
nodes increases, the DFCN protocol outperforms the PEGSP protocol. The SRBS algorithm
results best of three algorithms.
0
20
40
60
80
100
50 100 150 200 250 300 350 400
Network
Connectivity
Rate
Number of Nodes(Mobile Nodes Speed is 30m/s)
Network Connectivity Rate Vs No of Nodes
SRBS DFCN DSB PEGSP
0
500
1000
1500
2000
2500
3000
3500
4000
50 100 150 200 250 300 350 400
Collision
Rate
Number of Nodes(Speed of Mobile Nodes is 30m/s)
Collision Rate Vs No of Nodes
SRBS DFCN DSB PEGSP
16. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
36
Figure 15. End-to-End Delay Vs No of Nodes
Figure 16. Connectivity Rate Vs Traffic Overload of Node
According to Figure 16, a node's connection rate performance suffers as its traffic overload
grows. As a result, the SRBS algorithm achieves better results than the DSB, DFCN and PEGSP
algorithms.
5. CONCLUSIONS
The author proposed two broadcast protocols modify SRBS and DSB and compared them with
well-known existing broadcast algorithms. It is a reliable and high efficiency in a different traffic
pattern of highly mobile networks. When we send packets within the network, it takes minimum
nodes for communication from source to destination. This algorithm reduces flooding, broadcast
latency and redundancy problems. In our simulation, we have got measured the performance of
reliability, efficiency, throughput, average latency and rebroadcast. We have got tested the results
by varying node mobility, varies transmission ranges, number of nodes, degree of node, network
size, network connectivity rate, collision rate, end-to-end delay, and traffic overload of the node.
It shows best result when compared with the DFCN and PEGSP algorithms. Our result shows that
once we increase the quantity of nodes and node mobility then the SRBS algorithm produces
better results than the opposite three algorithms. In simulation results in some cases, we
have seen that if we do not increase node mobility and the number of nodes, then the results of
the DSB algorithm are better than the opposite three algorithms in terms of reachability, average
0
0.2
0.4
0.6
0.8
1
50 100 150 200 250 300 350 400
End-to-End
Delay
Number of Nodes(Mobile Node's speed is 30m/s)
End-to-End Delay Vs No of Nodes
SRBS DFCN DSB PEGSP
0
20
40
60
80
100
15 30 45 60 75 90 105 120
Connectivity
Rate
Traffic overload of Node(Node's Speed is 30m/s)
Connectivity Rate Vs Traffic overload of Node
SRBS DFCN DSB PEGSP
17. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
37
latencies, and throughput (Degree of nodes). If we increase the number of nodes and do not
increase node mobility, then the DFCN’s algorithm results are better than the PEGSP algorithm.
This algorithm is minimizing the frame length to communication in the network, which implies it
proves that the bandwidth of the channels is correctly utilized and provides the most throughputs.
CONFLICT OF INTEREST
The author has declared no competing interests for publication.
REFERENCES
[1] DemetresKouvatsos and Is-Haka Mkwawa, “Broadcasting Methods in Mobile Ad hoc Networks: An
Overview”, Department of Computing, University of Bradford, UK, Department of Computer
Science , University College Dublin, Ireland, in 2009.
[2] Ching-Chuan Chiang and Mario Gerla, “Routing and Multicast in Multi hop Mobile Wireless
Networks”, University of California, Los Angeles. In Proc.ICUPC’97.
[3] Eroll L. Lloyd, “Broadcast Scheduling for TDMA in wireless multi hop networks”, Department of
Computer Science and Information Sciences, University of Delaware, Hand book of wireless
Networks and Mobile Computing Pages 347-368, 2002.
[4] S.Ramanathan and E.L. Lloyd, “Scheduling Algorithms for Multi Hop Radio Networks”, IEEE/ACM
Transactions on Networking, 1:166-177, April 1993.
[5] Zygmunt.J.Haas and B.Liang, “ Ad hoc Mobility Management with Randomized Database groups”,
323 Frank Rhodes Hall, School of Electrical Engineering Cornel University, lthaca, NY 14853
Proceedings of the IEEE International Conference on communications 1756-1762, 1999.
[6] B. Williams and T.Camp, “Comparison of Broadcasting Techniques for Mobile Ad hoc Networks”,
Department of Math and Computer Science , Colorado, School of Mines Golden, CO 80401, In
Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc
02),194-205, March 2002.
[7] Wei Lou and Jie Wu, “A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile
Ad Hoc Networks”, Department of Computer Science and Engineering, Florida Atlantic University,
Conference on Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE, Volume: 6,
January 2004.
[8] Brian J. Wolf, Joseph L. Hammond, Daniel L.Noneaker and Harlan B. Russell, “Distributed
Formation of Broadcast Transmission Schedules for Mobile Ad Hoc Networks”,Dept. of Electrical
and Computer Engineering, Clemson University, Clemson SC, IEEE Volume-6, 2007.
[9] J.Jetcheva, Y.Hu, D.Maltz and D.Johnson, “A Simple Protocol for Multicast and Broadcast in Mobile
Ad hoc Networks”, Internet Draft, Draft-IETF-MANET simplembcast-01, 2001.
[10] Luc Hogie, Marcin Seredynski and Frederic Guinand, “A Bandwidth-Efficient Broadcasting Protocol
for Mobile Multi-Hop Ad hoc Networks”, Pascal BouvryUniversity,Luxembourg6, rueR.
CoudenhoveKalergiL- 1359 Luxembourg, Polish Academy of Sciences Ordona 2102-237, Warsaw,
Poland, University du Havre 25, rue Philippe Lebon76600 Le Havre, France. Proceedings of the
International Conference on Networking, International Conference on Systems and International
Conference on Mobile Communications and Learning Technologies (ICNICONSMCL’06) Computer
Society IEEE 2006.
[11] L. Hogie, F. Guinand, and P. Bouvry, “A heuristic for efficient broadcasting in the Metropolitan ad
hoc networks”, University du Havre, University du Luxembourg. University du Havre, 25, rue
Philippe Lebon 76600 Le Havre, France. University du Luxembourg Campus Kirchberg 6, rue
R.Coudenhove-Kalergi L-1359 Luxembourg. In KES, pages 727–733, 2004.
[12] H.A Ali, M.S Saleh, M.A. Sadik, “An Efficient Reliable Broadcast Algorithm in Ad hoc Networks
Based on Self-Pruning”,IJICIS, Vol.5, No. 1, July 2005.
[13] Chandra Kanta Samal, G.V. Singh and Sanjay Kumar Dhurandher, “Stable and Reliable Broadcast
Scheduling in Multi-Hop MANET”, AND College, University of Delhi, New Delhi, India, SC&SS,
Jawaharlal Nehru University, New Delhi, India and NSIT, University of Delhi, New Delhi, India,
International Journal of Engineering Science and Technology (IJEST), Vol. 3 No. 9 September 2011,
page no. 6962-6969, ISSN: 0975-5462.
18. International Journal of Computer Networks & Communications (IJCNC) Vol.15, No.2, March 2023
38
[14] Pei-Kai Hung, Jang-Ping Sheu and Chin-Shun Hsu, “Scheduling of Broadcasts in Multi-hop Wireless
Networks”, Dept. of Computer Science and Information Engineering, National Central University
Chung-Li, 320 Taiwan, R.O.C., European Wireless 2002 proceedings , 2002.
[15] Research Scholar S. Madhavi and Professor I. Ramesh Babu, “A New Method for Adaptive Broadcast
Scheduling in Mobile Ad hoc Networks”, Department of Computer Science and Engineering,
Acharya Nagarjuna University Guntur, A.P., India, IJCSNS International Journal of Computer
Science and Network Security, Vol.8 No.3, March 2008.
[16] Lim, H. and Kim, C, “Multicast tree construction and flooding in wireless ad hoc networks”, In
Proceedings of the 3rd ACM international workshop on modeling, analysis and simulation of wireless
and mobile systems, pages 61-68. ACM Press. (2000).
[17] Tseng, Y.-C., Ni, S.-Y, and Shih, E.-Y. “Adaptive Approaches to Relieving Broadcast Storms in a
Wireless Multihop Mobile Ad Hoc Network”, In Proceedings of the International Conference on
Distributed Systems, pages 481.488(2001).
[18] Peng, W. and Lu, X. C. ,“On the reduction of broadcast redundancy in mobile ad hoc networks”, In
Proceedings First Annual Workshop on Mobile and Ad Hoc Networking and Computing, pages 129-
130(2000).
[19] Chandra Kanta Samal, “Reliable Time Slot Allocation Scheme among Mobile Nodes in MANET”
AND College, University of Delhi, New Delhi, India, International Journal of Computer Science
Trends and Technology (IJCST), Volume 9, Issue 5, Sep-Oct 2021.
[20] GloMoSim:“Global Mobile Information Systems Simulation Library”,
http://pcl.cs.ucla.edu/projects/glomosim.
[21] Mario GerlaLokesh Bajaj, MineoTakai, Rajat Ahuja, RajiveBagrodia, “GloMoSim: A Scalable
Network Simulation Environment”, Technical Report 990027, University of California, 13, 1999.
[22] Richard A.Meyer and RajiveBagrodia, “PARSEC USER MANUAL for PARSEC. Release 1.1”,
Revised in September 1999, http://pcl.cs.ucla.edu,1999.
AUTHOR
Dr. Chandra Kanta Samal received the M. Tech. (CS) and Ph. D(CS) from Jawaharlal
Nehru University, New Delhi, India. Having 16th
years of teaching experience in the field
of Computer Science at AND College, Delhi University, New Delhi, India. More papers
published on Wireless Networks, Image Processing and robotics in various International
Journals and Conferences.