This document compares the performance of Wu and Li's Connected Dominating Set (CDS) creation algorithm and its location-information-based version under different Medium Access Control (MAC) protocols and network sizes. Simulations were conducted using an ideal MAC protocol and the IEEE 802.11 MAC protocol. The results show that using the 802.11 MAC produces smaller CDS sizes, lower signaling overhead, but longer establishment times compared to the ideal MAC. This is because packet collisions in the 802.11 MAC deprive nodes of accurate neighborhood information, leading to suboptimal CDS construction and longer delays.
Iterative network channel decoding with cooperative space-time transmissionijasuc
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative
communication utilizing space-time block codes. In cooperative communication, users besides
communicating their own information, also relay the information of other users. In this paper we
investigate a scheme where cooperation is achieved using two methods, namely, distributed space-time
coding and network coding. Two cooperating users utilize Alamouti space time code for inter-user
cooperation and in addition utilize a third relay which performs network coding. The third relay does not
have any of its information to be sent. In this paper we propose a scheme utilizing convolutional code based
network coding, instead of conventional XOR based network code and utilize iterative joint networkchannel
decoder for efficient decoding. Extrinsic information transfer (EXIT) chart analysis is performed to
investigate the convergence property of the proposed decoder.
Minimizing mobiles communication time using modified binary exponential backo...IJCNCJournal
The domain of wireless Local Area Networks (WLANs) is growing speedily as a consequence of
developments in digital communications technology. The early adopters of this technology have mainly
been vertical application that places a premium on the mobility offered by such systems. Examples of these
types of applications consist of stocking control in depot environments, point of sale terminals, and rental
car check-in. Furthermore to the mobility that becomes possible with wireless LANs; these systems have
also been used in environments where cable installation is expensive or impractical. Such environments
include manufacturing floors, trading floors on stock exchanges, conventions and trade shows, and historic
buildings. With the increasing propagation of wireless LANs comes the need for standardization so as to
allow interoperability for an increasingly mobile workforce. Despite all the advantages and facilities that
Wi-FI offers, there is still the delay problem that is due to many reasons that are introduced in details in
our case study which also presents the solutions and simulation that can reduce this delay for better
performance of the wireless networks
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
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.
Iterative network channel decoding with cooperative space-time transmissionijasuc
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative
communication utilizing space-time block codes. In cooperative communication, users besides
communicating their own information, also relay the information of other users. In this paper we
investigate a scheme where cooperation is achieved using two methods, namely, distributed space-time
coding and network coding. Two cooperating users utilize Alamouti space time code for inter-user
cooperation and in addition utilize a third relay which performs network coding. The third relay does not
have any of its information to be sent. In this paper we propose a scheme utilizing convolutional code based
network coding, instead of conventional XOR based network code and utilize iterative joint networkchannel
decoder for efficient decoding. Extrinsic information transfer (EXIT) chart analysis is performed to
investigate the convergence property of the proposed decoder.
Minimizing mobiles communication time using modified binary exponential backo...IJCNCJournal
The domain of wireless Local Area Networks (WLANs) is growing speedily as a consequence of
developments in digital communications technology. The early adopters of this technology have mainly
been vertical application that places a premium on the mobility offered by such systems. Examples of these
types of applications consist of stocking control in depot environments, point of sale terminals, and rental
car check-in. Furthermore to the mobility that becomes possible with wireless LANs; these systems have
also been used in environments where cable installation is expensive or impractical. Such environments
include manufacturing floors, trading floors on stock exchanges, conventions and trade shows, and historic
buildings. With the increasing propagation of wireless LANs comes the need for standardization so as to
allow interoperability for an increasingly mobile workforce. Despite all the advantages and facilities that
Wi-FI offers, there is still the delay problem that is due to many reasons that are introduced in details in
our case study which also presents the solutions and simulation that can reduce this delay for better
performance of the wireless networks
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
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.
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...cscpconf
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages; however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm; however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use of a virtual ideal MAC enables us to investigate how the real-world performance of these algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
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.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Mobility and Propagation Models in Multi-hop Cognitive Radio Networksszhb
Cognitive radio networks allow unlicensed
(secondary) users to opportunistically utilize the idle
resource of a licensed network for communication
without affecting the quality of service being offered to
the primary or licensed users. This paper investigates
the effect of mobility on performance of multi-hop
cognitive radio network under various propagation
models. MPEG4 video; a bandwidth intensive traffic, is
tested over these network conditions for secondary
users and results are validated using NS2 simulations.
Performance metrics used for evaluation include
throughput, delay variations etc.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...cscpconf
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages; however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm; however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use of a virtual ideal MAC enables us to investigate how the real-world performance of these algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
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.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Mobility and Propagation Models in Multi-hop Cognitive Radio Networksszhb
Cognitive radio networks allow unlicensed
(secondary) users to opportunistically utilize the idle
resource of a licensed network for communication
without affecting the quality of service being offered to
the primary or licensed users. This paper investigates
the effect of mobility on performance of multi-hop
cognitive radio network under various propagation
models. MPEG4 video; a bandwidth intensive traffic, is
tested over these network conditions for secondary
users and results are validated using NS2 simulations.
Performance metrics used for evaluation include
throughput, delay variations etc.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
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.
Secure data storage over distributed nodes in network through broadcast techn...eSAT Publishing House
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
Performance Comparison and Analysis of Mobile Ad Hoc Routing ProtocolsCSEIJJournal
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead
of static network infrastructure to provide network connectivity. MANETs have applications in rapidly
deployed and dynamic military and civilian systems. The network topology in a MANET usually changes
with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing
protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols
and comparing and improving existing MANET routing protocols before any routing protocols are
standardized using simulations. However, the simulation results from different research groups are not
consistent with each other. This is because of a lack of consistency in MANET routing protocol models
and application environments, including networking and user traffic profiles. Therefore, the simulation
scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is
difficult for one to choose a proper routing protocol for a given MANET application. According to the
aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution
includes the characterization of different routing protocols and compare and analyze the performance of
different routing protocols.
A Cooperative Approach to Extend Cellular Coverage via D2D Architecture based...IJCNCJournal
The access part of all cellular network’s generation suffers from common concerns related to dead spots (zones that are not covered by the network) and hot spots (zones where the number of users is higher compared to network resources). During the last decade, lots of research proposals have tried to overcome cellular problems through multi-hop D2D architecture, which is a new paradigm allowing the direct communication between devices in cellular network to enhance network performances and improve user QoS. In this paper, we propose a multi-hop D2D architecture based on the OLSR protocol to extend cellular coverage. Cell-OLSR, which is the proposed adaptation of OLSR for our architecture, allows the exchange of cellular parameters between nodes to choose the best proxy device to forward data to the cellular base station (BS).
Broadcast is one of the most important approach in distributed memory parallel computers that is used to
find a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds to one-to-all communication. Routing schema is the approach that used to determine the road that is used to send a message from a source node to destination nodes. In this paper, we propose an efficient two algorithms for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. In wormhole routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the
routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t deliver to their destination and there is a cyclic dependence over the channels in the network, then the deadlock even is occurred. In this paper we introduce an efficient two algorithms, Three-Dimension Hamiltonian Broadcast (3-DHB) and Three-Dimension Six Ports Hamiltonian Broadcast (3-DSPHB) which used broadcast communication facility with deadlock-free wormhole routing in general threedimensional networks. In this paper the behaviors of these algorithms were compared using simulation. The results presented in this paper indicate that the advantage of the proposed algorithms.
In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all the nodes existing in the network through successive data transmissions between pairs of nodes. Broadcasting is the most primary communication process in a network. In this paper, we study on multiport wormhole-routed multicomputers where nodes are able to send multiple messages into the network at a
time. We propose efficient broadcast algorithms in multi-port wormhole-routed multicomputers which are characterized by 3D mesh topology. The proposed algorithm Three-Dimension Broadcast Layers (3-DBl) is designed such that can send messages to destinations within two start-up communication phases for each 2-D mesh. The second proposed algorithm Three-Dimension Broadcast Surfaces (3-DBS) is designed such that can send messages to destinations within six start-up communication phases. The performance study in
this paper clearly shows the advantage of the proposed algorithm.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
Detecting of routng misbehavion in hybrid wireless networks used and acknowle...AAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service (QoS) requirements in real time
transmission for wireless application. But it stream including critical mission application like military use or emergency
recovery. Hybrid wireless networks is unified mobile ad-hoc network (MANET) and wireless infrastructure networks. It inherits
invalid reservation and race condition problem in Mobile ad-hoc network (MANET). Whereas open medium and wide
distribution of node make vulnerable to malicious attackers in Hybrid wireless networks. How to secure routing in Hybrid
wireless networks. In this paper, we propose a Enhanced Adaptive ACKnowledgment (EAACK)-implement a new intrusiondetection
system for Hybrid wireless networks. It protect Hybrid wireless networks from attacks that have higher malicious
behavior detection rate. Analytical and simulation result based on the real human mobility mode. EAACK can provide high secure performance in terms of Intrusion-detection, overhead, transmission delay
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Similar to A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS USING IDEAL MAC AND IEEE 802.11 MAC (20)
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
2. Computer Science & Information Technology (CS & IT)
56
fixed or pre-installed communications infrastructure. The self-control, self-organization, and Ad
Hoc properties make MANETs applicable in both civilian and military sectors. Their applications
range from providing temporary and instantly deployable communications networks in
conference rooms, class rooms, and exhibitions to providing reliable inter-vehicle
communications, and communications networks in rural areas, devastated areas, and battle fields
[1].
Along with their attractive properties, MANETs have other properties that make their realization
a challenging task. Due to the mobile nature and the limited transmission ranges of MANETs’
nodes, communication links between nodes are established and torn down in unpredictable
fashion; therefore, MANETs are characterized by dynamic topologies. The self- control property,
a powerful feature of MANETs, obliges nodes to perform routing and other network
administrative tasks cooperatively. The routing algorithms used in traditional wired networks
generate a huge amount of overhead traffic in order to discover and maintain routes in such
dynamic topologies. The limited bandwidth of the wireless channel renders all these algorithms
non-feasible for MANETs routing.
The Connected Dominating Set (CDS), a.k.a. virtual backbone or spine, is a proposed solution for
routing, broadcasting, and establishing a dynamic infrastructure for distributed location databases
in MANETs [5], [8], [11], [12]. Minimizing the CDS cardinality simplifies the MANET’s
abstracted topology, allows for using shorter routes, and reduces the total number of
retransmissions in broadcasting scenarios. It is proven that finding the minimum CDS (MCDS) in
general graphs is NP-complete [7]; therefore, approximation algorithms and heuristics are used to
tackle this problem.
The literature is rich of many CDS approximation algorithms competing in terms of CDS size,
running time, and signaling overhead [3], [6], [9], [10], [12], [14], [16]. It has been reported that,
among all competing algorithms, localized CDS creation algorithms are the fastest and the
lightest in terms of signaling overhead [2]. Examples of these algorithms are Wu and Li algorithm
[9], the MPR algorithm [13], and Alzoubi algorithm [4]. The simplest and the fastest among all
these algorithms is Wu and Li algorithm; however, this algorithm has a relatively high signalling
overhead. To reduce the signaling overhead, proposals were made that are based on utilizing
nodes’ location information [11], [20].
In this paper we compare the performance of the original Wu and Li algorithm [9] with that of its
Location-Information-Based version given in [20] under two different types of Medium Access
Control protocols (MAC protocols) and several network sizes. The MAC protocols used are: a
virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol [21]. While the ideal MAC
protocol adheres to the design assumption made by the algorithms designers regarding the
guaranteed delivery of broadcasted packets, the IEEE 802.11 MAC violates this assumption since
broadcasted packets may not be correctly delivered due to packet collisions. The use of a virtual
ideal MAC gives us the ability to investigate how the real-world performance of these algorithms
deviates from their ideal-conditions counterpart.
The rest of this paper is organized as follows: Section 2 gives a description of the working
mechanics of Wu and Li algorithm [9] and its Location-Information-Based version [20]. Section
3 deals with the experiment setup. In section 4, the results are presented and discussed. Finally,
section 5 concludes this paper.
3. 57
Computer Science & Information Technology (CS & IT)
2. ALGORITHMS DESCRIPTION
This section gives a description of the CDS creation and maintenance mechanisms of the studied
algorithms.
2.1. Wu and Li Algorithm
Initially the CDS is empty. Every node starts by broadcasting a list that contains the identities of
its 1-hop neighbors. Exchanging this information with neighbors allows every node to know the
identities of all nodes in its 2-hop neighborhood and the connections among its 1-hop neighbors.
Based on this knowledge, every node decides whether to join the CDS or not and it informs its
neighbors about this decision. A node, आ, joins the CDS if it has at least two neighbors that are
not directly connected to each other. After receiving the decisions of all its neighbors, a CDS
member, υ, makes its final decision regarding whether to withdraw from the CDS or not, and it
informs its neighbors about this decision. υ withdraws from the CDS in one of two cases; the first
case is when υ has a neighbor u such that N[υ] ⊆ N[u] and id(υ) < id(u), where N[υ] is the closed
1-hop neighborhood of node υ and id(υ) is υ’s ID; the other case is when υ has two neighbors u
and w such that u and w are directly connected and N[υ] ⊆ N[u] ∪ N[w] and id(υ) = min(id(υ),
id(u), id(w)). To maintain the CDS in face of topology changes, every node, आ, exchanges its 1hop neighborhood information with its neighbors whenever it discovers a topology change. Every
node u ∈ N[आ] updates its role according to the connectivity of its current 1-hop neighborhood by
applying the rules explained above.
2.2. Location-Information-Based Wu and Li Algorithm
To reduce the signaling overhead of Wu and Li algorithm, Stojmenovic et al. proposed that nodes
have to broadcast their location information, i.e. X and Y coordinates, instead of broadcasting
their lists of neighbors [11]. Using the location information of its neighbors, a node, आ, can
discover if any two of its neighbors are directly connected or not; nodes u and w are directly
connected if the Euclidean distance between them is shorter than the transmission range;
otherwise, they are not connected; however, in [20], it was shown that utilizing the location
information does not guarantee the reduction of signaling overhead. The argument made in [20] is
that since the node ID is a four-byte integer number while its location information, i.e. its X and
Y coordinates, is two eight-byte floating point numbers, broadcasting the location information of
a given node is more costly, in terms of signaling overhead, than broadcasting its list of neighbors
if this node has three neighbors or less. Based on this argument, it was shown that in order to
reduce the signaling overhead of Wu and Li algorithm every node has to broadcast its X and Y
coordinates only if it has more than four neighbors; otherwise, it must broadcast its neighbors list.
3. EXPERIMENT SETUP
The simulator used in this study is the ns-2 network simulator [17], a widely used discrete event
simulator targeted at network research. Nodes use Hello messages to discover their neighborhood;
every node broadcasts a Hello message every second. The transmission range of every node is set
to 250 meters. To reduce the effect of the short-live connections that are formed when fast
moving nodes come into the transmission range of each other for very short periods of time, node
υ does not add node u to its neighbors list until it receives the third consecutive Hello message
from u.
The network sizes simulated range from 30 nodes to 100 nodes with increments of 10. The
mobility model used is the Random Waypoint mobility model [18] and a field of 2000 m × 2000
m was used with this model. The speed of movement was uniformly distributed between 20 and
4. Computer Science & Information Technology (CS & IT)
58
25 m/s. For every network size, two different MAC protocols were used: a virtual ideal MAC
protocol, and the IEEE 802.11 MAC protocol. For every network size and MAC protocol, fifteen
different movement scenarios were simulated. Every simulation lasted for 300 seconds. The
average of the results of every set of fifteen simulations is calculated and used to represent the
algorithm’s performance under the given network size and MAC protocol.
4. EXPERIMENT RESULTS
The results obtained from the conducted simulations are presented in the following figures. These
results include the CDS size, the unicast signaling overhead, the broadcast signaling overhead, the
CDS establishment time, and the total running time.
4.1. The CDS size
The average size of the CDS produced by each algorithm as a function of the network size for
each MAC protocol is given in figures 1 and 2. It can be seen that, in both algorithms, using the
IEEE 802.11 MAC leads to creating smaller CDS compared to that created by using the virtual
ideal MAC. The fact that in broadcasting scenarios the IEEE 802.11 MAC does not eliminate
collisions is the reason for this decrease in CDS size. Losing packets due to collisions prevents
nodes from having accurate knowledge about changes in their 1-hop neighborhood and this
inaccurate knowledge prevents nodes that are supposed to join the CDS from joining it and
decreases the CDS size.
Figure 1. Size of the CDS created by Wu and Li algorithm for different number of nodes and MAC
protocols.
5. 59
Computer Science & Information Technology (CS & IT)
Figure 2. Size of the CDS created by Location-Information-Based Wu and Li algorithm for different
number of nodes and MAC protocols.
4.2. Unicast Signaling Overhead
Unicast signaling refers to messages sent from a sender to a specific receiver. In this type of
signaling, the IEEE 802.11 MAC uses a handshaking mechanism between the sender and the
receiver to avoid collisions; however, this handshaking mechanism does not eliminate collisions
completely, since unicasted packets may collide with packets broadcasted by hidden nodes [19].
Figures 3 and 4 show the average number of bytes unicasted by every node during the CDS
creation and maintenance phases of each algorithm as a function of the network size for each
MAC protocol. It can be noticed that, in both algorithms, using the IEEE 802.11 MAC leads to
generating less unicast signaling compared to that generated by using the virtual ideal MAC. The
fact that the IEEE 802.11 MAC does not eliminate collisions completely is the reason for this
decrease in unicast signaling. Due to collisions, nodes may not get updated about changes in their
1-hop neighborhood; therefore, they do not react to these changes and this leads to generating less
unicast signaling overhead.
4.3. Broadcast Signaling Overhead
Broadcast signaling refers to messages sent from a sender to all its neighbors. In this type of
signaling, the IEEE 802.11 MAC does not use a handshaking mechanism between the sender and
the receiver so that the chances of collisions are high; hence, broadcast signaling is considered a
problematic type of signaling. Figures 5 and 6 show the average number of bytes broadcasted by
every node during the CDS creation and maintenance phases of each algorithm as a function of
the network size for each MAC protocol. It can be noticed that, in both algorithms, using the
IEEE 802.11 MAC leads to generating less broadcast signaling compared to that generated by
using the virtual ideal MAC. This decrease in broadcast signaling overhead is due to lack of
updates about neighborhood changes that results from losing of packets because of collisions.
5. THE CDS ESTABLISHMENT TIME
The CDS establishment time is the time at which every node knows whether it is a CDS member
or not. Figures 7 and 8 show the average CDS establishment time for each algorithm as a
function of network size for each MAC protocol. It can be noticed from these figures that, in both
6. Computer Science & Information Technology (CS & IT)
60
algorithms, using the IEEE 802.11 MAC leads to longer CDS establishment time compared to the
time spent in CDS establishment by using the virtual ideal MAC. Losing of packets due to
collisions forces nodes to keep waiting for retransmissions of the lost packets and this results in
longer CDS establishment time.
Figure 3. Unicast signaling overhead generated by Wu and Li algorithm for different number of nodes and
MAC protocols.
Figure 4. Unicast signaling generated by Location-Information-Based Wu and Li algorithm for different
network sizes and MAC protocols.
7. 61
Computer Science & Information Technology (CS & IT)
Figure 5. Broadcast signaling overhead generated by Wu and Li algorithm for different number of nodes
and MAC protocols.
6. THE TOTAL RUNNING TIME
The total running time is the time spent during CDS creation and maintenance phases. The
average total time of each algorithm as a function of the network size for each MAC protocol is
shown in figures 9 and 10. Again, we notice that using the IEEE 802.11 MAC leads to longer
total time compared to the time spent by using the virtual ideal MAC, and the reason for this is
the loss of packets due to collisions that keeps nodes waiting for retransmissions of the lost
packets.
Figure 6. Broadcast signaling generated by Location-Information-Based Wu and Li algorithm for different
network sizes and MAC protocols.
8. Computer Science & Information Technology (CS & IT)
62
Figure 7. Time to establish the CDS by Wu and Li algorithm for
different number of nodes and MAC protocols.
7. CONCLUSION
In this paper the performance of the original Wu and Li algorithm is compared with that of its
Location-Information-Based version under a virtual ideal MAC protocol and the IEEE 802.11
MAC protocol. The performance is measured in terms of CDS size, signaling overhead, and run
time. The results obtained showed that using the IEEE 802.11 MAC protocol leads to smaller
CDS size, lighter signaling overhead, and longer run times compared to those obtained by using
the virtual ideal MAC protocol. The reason of these deviations is the loss of packets due to
collisions. This loss of packets deprives nodes of acquiring accurate knowledge and fast updates
about changes of their 1-hop neighborhoods, this lack of accurate and up-to-date information may
lead nodes to refrain from joining the CDS erroneously, not broadcast information unaware of
neighborhood changes, and spend longer time waiting for information.
Figure 8. Time to establish the CDS by Location-Information-Based Wu and Li algorithm for
different number of nodes and MAC protocols.
9. 63
Computer Science & Information Technology (CS & IT)
Figure 9. Total running time by Wu and Li algorithm for different
number of nodes and MAC protocols.
Figure 10. Total running time by Location-Information-Based Wu and Li algorithm for different number of
nodes and MAC protocols.
REFERENCES
[1]
[2]
[3]
[4]
[5]
C. E. Perkins (2001) Ad Hoc Networking, Addison-Wesley.
S. Basagni, M. Mastrogiovanni, A. Panconesi and C. Petrioli , (2006) “Localized Protocols for Ad
Hoc clustering and Backbone Formation: A Performance Comparison”, IEEE Trans. Parallel Distrib.
Syst., Vol. 17, No. 4, pp292–306.
P. Wan, K. Alzoubi, and O. Frieder, (2004) “Distributed Construction of Connected Dominating Set
in Wireless Ad Hoc Networks”, MONET Vol. 9, No. 2, pp141–149.
K. Alzoubi, (2002) “Virtual Backbones in Wireless Ad Hoc Networks”, PhD thesis, Illinois Institute
of Technology.
R. Sivakumar, P.Sinha, and V. Bharghavan, (1999) “CEDAR: A Core-Extraction Distributed Ad Hoc
Routing Algorithm”, IEEE Journal on Selected Areas in Communications, Vol. 17, pp1454–1465.
10. Computer Science & Information Technology (CS & IT)
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
64
Jeremy, B. M. Ding, A. Thaeler, and X. Cheng, (2004) “Connected Dominating Set in Sensor
Networks and MANETs”, Handbook of Combinatorial Optimization D.-Z. Du and P. Pardalos (Eds.),
pp329–369, Kluwer Academic Publishers.
S. Guha, and S. Khuller, (1998), “Approximation algorithms for connected dominating sets,
Algorithmica”, Vol. 20, pp374–387.
B. Das, and V. Bharghavan, (1997), “Routing in Ad Hoc Networks Using Minimum Connected
Dominating Sets”, International Conference on Communications, Montreal, Canada.
J. Wu and H. Li, (1999), “On calculating connected dominating set for efficient routing in Ad Hoc
wireless networks”, in DIAL M’99, Seattle, pp7–14.
L. Jia, R. Rajaraman, and T. Suel (2001), “An Efficient Distributed Algorithm for Constructing Small
Dominating Sets”, in Proceedings of the 20th ACM Symposium on Principles of Distributed
Computing (PODC’01).
I. Stojmenovic, M. Seddigh, and J. Zunic, (2002), “Dominating Sets and Neighbor Elimination-Based
Broadcasting Algorithms in Wireless Networks”, IEEE Transactions on Parallel and Distributed
Systems, Vol. 13, pp14–25.
B. Liang and Z. J. Haas, (2000), “Virtual Backbone Generation and Maintenance in Ad Hoc Network
Mobility Management”, in INFOCOM, pp1293–1302.
J. Wu, (2003), “An Enhanced Approach to Determine A Small Forward Node Set Based on
Multipoint Relays”, in Proc. of IEEE VTC, Vol. 4, pp2774–2777.
D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, (2003), “Fast Distributed
Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons”, in Proc. ACMSIAM Symposium on Discrete Algorithms (SODA), pp717–724.
K. M. Alzoubi, P.-J. Wan, and O. Frieder, (2002), “Message-Optimal Connected Dominating-Set
Construction for Routing in Mobile Ad Hoc Networks”, in 3rd ACM International Symposium on
Mobile Ad Hoc Networking and Computing (MobiHoc02).
S. Parthasarathy and R. Gandhi, (2004), “Fast Distributed Well Connected Dominating Sets for Ad
Hoc Networks, Technical Report CS-TR-4559, University of Maryland, Computer Science
Department.
K. Fall and K. Varadhan: The ns Manual (formerly ns Notes and Documentation),The VINT Project.
D. Johnson, D. Maltz, J. Jetcheva, (2002), “The Dynamic Source Routing Protocol for Mobile Ad
Hoc Networks”, Internet Draft, draft-ietf-manet-dsr-07.txt, work in progress,.
https://en.wikipedia.org/wiki/Hidden node problem
K. Almahorg, S. Naik, and X. Shen, (2010), “Efficient Localized Protocols to Compute Connected
Dominating Sets for Ad Hoc Networks”, IEEE GLOBECOM,.
http://grouper.ieee.org/groups/802/11/main.html.