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
International Journal of Engineering Research and DevelopmentIJERD Editor
This document describes the simulation and performance evaluation of a wireless ad hoc network using the NS2 simulator. The network uses the AODV routing protocol. 15 nodes were simulated over a 1000m x 800m area for 1000 seconds, with 6 concurrent UDP connections. Packet delivery ratio, throughput, and packet drop ratio were evaluated based on the trace file data. The simulation found a packet delivery ratio of 0.71 and throughput of around 534.19 kbps for the AODV protocol in the simulated network.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
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.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Collective approach for manets to support packet loss and delay sensitive app...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
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
The document discusses an algorithm for detecting cuts or disconnections in wireless sensor networks. The algorithm allows each node to detect when it becomes disconnected from a designated source node (DOS event) and allows some nodes to detect when a cut occurs elsewhere in the network without disconnecting from the source (CCOS event). The distributed cut detection (DCD) algorithm is asynchronous and involves nodes iteratively computing their electrical potentials. For DOS detection, a node needs only communicate a scalar value to neighbors. For CCOS detection, nodes require position information. The algorithm enables detection of cuts and their approximate locations with convergence independent of network size or structure.
International Journal of Engineering Research and DevelopmentIJERD Editor
This document describes the simulation and performance evaluation of a wireless ad hoc network using the NS2 simulator. The network uses the AODV routing protocol. 15 nodes were simulated over a 1000m x 800m area for 1000 seconds, with 6 concurrent UDP connections. Packet delivery ratio, throughput, and packet drop ratio were evaluated based on the trace file data. The simulation found a packet delivery ratio of 0.71 and throughput of around 534.19 kbps for the AODV protocol in the simulated network.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
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.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Collective approach for manets to support packet loss and delay sensitive app...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
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
The document discusses an algorithm for detecting cuts or disconnections in wireless sensor networks. The algorithm allows each node to detect when it becomes disconnected from a designated source node (DOS event) and allows some nodes to detect when a cut occurs elsewhere in the network without disconnecting from the source (CCOS event). The distributed cut detection (DCD) algorithm is asynchronous and involves nodes iteratively computing their electrical potentials. For DOS detection, a node needs only communicate a scalar value to neighbors. For CCOS detection, nodes require position information. The algorithm enables detection of cuts and their approximate locations with convergence independent of network size or structure.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
This document contains 16 important questions covering various topics related to computer networks across 5 units. The questions cover topics such as the ISO-OSI model, data encoding schemes, error detection and correction mechanisms, network layer protocols, transport layer protocols, network security, application layer protocols, and web technologies. Key topics include data link layer functions, error detection methods, flow control, network layer routing protocols, transport layer protocols TCP and UDP, network security concepts, and application layer protocols like HTTP, FTP, and DNS.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
This document contains 30 important questions related to data communication networks for a pre-university exam. The questions cover a range of topics including comparing TCP and OSI models, explaining IPv6, drawing and explaining the TCP/IP architecture, different network devices, transmission mediums, ALOHA protocols, congestion control algorithms, routing algorithms like Dijkstra's, data rates and bandwidth, error detection methods, network switching, application and transport layers, Hamming codes, technologies like Bluetooth, cryptography, ATM, network security, generations of Ethernet, PPP and HDLC frame structures, differences between various guided and unguided media, protocols, topologies, and cables, CSMA/CD networks, and ARQ protocols.
This document summarizes issues related to medium access control (MAC) protocols for wireless ad hoc networks. It discusses common MAC protocols like ALOHA, Slotted ALOHA, CSMA, and their variants. It also covers protocols specific to wireless networks like MACA, MACAW, and CSMA/CA. Additional topics covered include Bluetooth, wireless mesh networks, mobile ad hoc networks, and wireless sensor networks. Simulation tools for modeling wireless ad hoc networks are also mentioned.
This document provides information about data communication networks for 4th year B.Tech ECE students at Ashoka Institute of Technology & Management in Varanasi, India. It covers topics like the criteria for effective networks, the OSI model layers grouped by function, how headers and trailers are added and removed in layers, the features provided by layering, why protocols are needed, the interfaces provided by protocols, different physical media, signals, wavelength, modulation, duplex types, CODECs, spread spectrum techniques, encoding, the differences between NRZ-L and NRZ-I, the responsibilities of the data link layer, ways to address framing, peer-to-peer vs. primary-secondary relationships, error types and detection
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...iosrjce
Mobile Ad-hoc Network is a decentralized wireless network[1]. Here the mobile nodes make and
break the links with the neighbouring nodes available in the radio range without actually being physically
connected. These networks are temporary and keep on changing from time to time. MANET applications are
getting importance in both civilian and military areas. MANETs can be applied in disaster communications and
used as the backup network of traditional mobile communication networks as well. Network throughput, number
of packets dropped and average latency are important parameters to evaluate the performance of wireless ad
hoc network[3]. Generally, it is difficult to achieve high throughput and low packet drop with minimum
delay[5]. In this paper, the objective is to achieve high throughput while keeping the packet drop and the
average latency under certain acceptable limits[10]. We tried to study the signature pattern of these malicious
nodes and made conclusions with the results obtained. The performance is evaluated with the following
parameters: network throughput, number of packets dropped and the average latency. We used NS2 simulator
and extracted data from the trace files[2]. Ad-hoc On Demand Distance Vector (AODV) routing protocol has
been used in our experiments[4]. Similar to our previous work, the nodes are free to move or remain static in all
the quadrants in the defined space[8].
Iterative network channel decoding with cooperative space-time transmissionijasuc
This document summarizes an iterative network-channel decoding scheme for cooperative space-time transmission with network coding. The scheme uses convolutional codes as network codes at the relay node and Reed-Solomon codes as channel codes at the user nodes. An iterative joint network-channel decoder exchanges soft information between convolutional code-based network decoder and Reed-Solomon code-based channel decoders. Extrinsic information transfer analysis is performed to investigate the convergence properties of the proposed iterative decoder.
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.
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.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This paper proposes a lightweight decentralized algorithm for localizing reactive jammers in wireless sensor networks. The algorithm uses a three step process: 1) anomaly detection to identify potential victim nodes, 2) estimation of jammer properties like jamming range, and 3) trigger identification where victim nodes test themselves to identify as trigger or non-trigger nodes. Theoretical analysis and simulation results show that the algorithm can accurately estimate jammer properties while maintaining low time and message complexity. It is also robust against advanced jamming models and provides benefits like improved routing compared to existing techniques.
Energy saving Wireless Sensor Networks using KerberosEditor IJCATR
The wireless sensor network is an networking field that combines sensing, computation, and communication into a single
tiny device. As sensor networks frame closer towards well-known deployment, security issues become a vital concern. So far, much
work has focused on making sensor networks realistic and useful, but still security in sensor network data communication is big issue
for research. This paper proposed the idea of having different Kerberos authentication architecture for the different clusters in sensor
network to save energy factor of the sensor nodes and to save time for data communication between the sensor nodes in the network
Performance Evaluation of Wormhole Attack In AODVIJERA Editor
The Mobile Ad hoc Networks (MANETs) is a collection of wireless nodes which interact with each other by sending packets to one another or on behalf of another node, without any central network infrastructure to control data routing. For communication, the nodes cooperatively forward data packets to other nodes in network by using the routing protocol. But, these routing protocols are not secure, thus paving the way for the MANET to be open to malicious attacks. A malicious attack which is commonly observed in MANET environment is wormhole attack. The objective of this work is to analyze the performance parameters of throughput, delay and packet loss in AODV with the existence of wormhole attack. Simulation results have shown that the performance parameters are affected very much when there is an attack due to wormholes
Preventing Malicious Node and Provide Secure Routing In ManetIOSR Journals
This document proposes SIEVE, a decentralized technique to identify malicious nodes in mobile ad hoc networks (MANETs). SIEVE uses rateless coding and the LT decoding process to detect corrupted data packets. It constructs a factor graph based on "checks" that nodes generate when decoding data. These checks contain information about which nodes provided packet data and whether the data was corrupted. SIEVE runs belief propagation on the factor graph to compute the probability that each node is malicious based on the checks. Simulation results show that SIEVE can accurately identify malicious nodes and is robust against various attacks, while having low computational and communication costs suitable for MANETs.
A New Programming Model to Simulate Wireless Sensor Networks : Finding The Be...IJCNCJournal
This document summarizes a research paper that proposes a new programming model for wireless sensor networks. The programming model aims to find the best routing path between sensor nodes by coding the actual sensor nodes to perform tasks. The paper reviews existing programming models and requirements for sensor network programming such as energy efficiency, scalability, localization, and time synchronization. It then describes the proposed model and compares results from applying the model in different network topologies using multiple routing algorithms.
AN EFFICIENT ANT BASED QOS AWARE INTELLIGENT TEMPORALLY ORDERED ROUTING ALGOR...IJCNCJournal
This document summarizes an ant-based routing algorithm for mobile ad hoc networks that aims to improve network lifetime, reduce packet loss, and decrease average end-to-end delay. It combines aspects of Ant Colony Optimization and the Temporally Ordered Routing Algorithm (TORA). The algorithm is designed to find multiple paths between sources and destinations in the network while satisfying quality of service constraints like delay, bandwidth, energy consumption, and data rate. It is claimed to be suitable for real-time and multimedia applications in mobile ad hoc networks.
IMPROVING IPV6 ADDRESSING TYPES AND SIZEIJCNCJournal
This document discusses proposed modifications to IPv6 addressing types and address size. It suggests that multicast addressing can mimic anycast and limited broadcast addressing, making those types unnecessary. It also proposes reducing the IPv6 address size from 128-bits to decrease packet overhead, while ensuring the new size supports future internet growth. A formula is presented to predict IP address exhaustion dates for different address sizes based on current usage and population projections.
An Optimal Software Framework for Parallel Computation of CRCIJCNCJournal
CRC is a common error detection method used in different areas such as information storage and data
communication. CRC depends on modulo-2 division by a predetermined divisor called the generator. In
this method, the transmitter divides the message by the generator and concatenates the calculated residue
to the message. CRC is not able to detect every kind of errors. The properties of the generator determine
the range of errors which are detectable in the receiver side. The division operation is currently performed
sequentially, so developing methods for parallel computation of the residue makes CRC suitable for
network protocols and software applications. This paper presents a novel software framework for parallel
computation of CRC using ODP polynomials.
EFFECT OF OPERATING WAVELENGTHS AND DIFFERENT WEATHER CONDITIONS ON PERFORMAN...IJCNCJournal
Free Space Optical (FSO) communication is a very recent and emerging technology to establish broadband
wireless data transmission system using modulated optical beams. The adoption of FSO system is mainly
needed when any physical connection between the transmitter and receiver is practically impossible and
where high bandwidth data transmission is expected. The performance of FSO communication technology
is highly dependent on atmospheric attenuation which is related to the visibility of the different weather
conditions as well as operating wavelengths. This paper presents our study about the effect of visibility as
well as operating wavelengths on atmospheric attenuation in different weather conditions for point-to-point
free space optical link. Moreover, it also discusses the methodology to find out the optimum link distance
for point-to-point FSO link which will be operated in different weather conditions. It is found that,
atmospheric attenuation is changed with the change in weather condition as well as operating wavelengths.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
This document contains 16 important questions covering various topics related to computer networks across 5 units. The questions cover topics such as the ISO-OSI model, data encoding schemes, error detection and correction mechanisms, network layer protocols, transport layer protocols, network security, application layer protocols, and web technologies. Key topics include data link layer functions, error detection methods, flow control, network layer routing protocols, transport layer protocols TCP and UDP, network security concepts, and application layer protocols like HTTP, FTP, and DNS.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
This document contains 30 important questions related to data communication networks for a pre-university exam. The questions cover a range of topics including comparing TCP and OSI models, explaining IPv6, drawing and explaining the TCP/IP architecture, different network devices, transmission mediums, ALOHA protocols, congestion control algorithms, routing algorithms like Dijkstra's, data rates and bandwidth, error detection methods, network switching, application and transport layers, Hamming codes, technologies like Bluetooth, cryptography, ATM, network security, generations of Ethernet, PPP and HDLC frame structures, differences between various guided and unguided media, protocols, topologies, and cables, CSMA/CD networks, and ARQ protocols.
This document summarizes issues related to medium access control (MAC) protocols for wireless ad hoc networks. It discusses common MAC protocols like ALOHA, Slotted ALOHA, CSMA, and their variants. It also covers protocols specific to wireless networks like MACA, MACAW, and CSMA/CA. Additional topics covered include Bluetooth, wireless mesh networks, mobile ad hoc networks, and wireless sensor networks. Simulation tools for modeling wireless ad hoc networks are also mentioned.
This document provides information about data communication networks for 4th year B.Tech ECE students at Ashoka Institute of Technology & Management in Varanasi, India. It covers topics like the criteria for effective networks, the OSI model layers grouped by function, how headers and trailers are added and removed in layers, the features provided by layering, why protocols are needed, the interfaces provided by protocols, different physical media, signals, wavelength, modulation, duplex types, CODECs, spread spectrum techniques, encoding, the differences between NRZ-L and NRZ-I, the responsibilities of the data link layer, ways to address framing, peer-to-peer vs. primary-secondary relationships, error types and detection
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Impact of Malicious Nodes on Throughput, Packets Dropped and Average Latency ...iosrjce
Mobile Ad-hoc Network is a decentralized wireless network[1]. Here the mobile nodes make and
break the links with the neighbouring nodes available in the radio range without actually being physically
connected. These networks are temporary and keep on changing from time to time. MANET applications are
getting importance in both civilian and military areas. MANETs can be applied in disaster communications and
used as the backup network of traditional mobile communication networks as well. Network throughput, number
of packets dropped and average latency are important parameters to evaluate the performance of wireless ad
hoc network[3]. Generally, it is difficult to achieve high throughput and low packet drop with minimum
delay[5]. In this paper, the objective is to achieve high throughput while keeping the packet drop and the
average latency under certain acceptable limits[10]. We tried to study the signature pattern of these malicious
nodes and made conclusions with the results obtained. The performance is evaluated with the following
parameters: network throughput, number of packets dropped and the average latency. We used NS2 simulator
and extracted data from the trace files[2]. Ad-hoc On Demand Distance Vector (AODV) routing protocol has
been used in our experiments[4]. Similar to our previous work, the nodes are free to move or remain static in all
the quadrants in the defined space[8].
Iterative network channel decoding with cooperative space-time transmissionijasuc
This document summarizes an iterative network-channel decoding scheme for cooperative space-time transmission with network coding. The scheme uses convolutional codes as network codes at the relay node and Reed-Solomon codes as channel codes at the user nodes. An iterative joint network-channel decoder exchanges soft information between convolutional code-based network decoder and Reed-Solomon code-based channel decoders. Extrinsic information transfer analysis is performed to investigate the convergence properties of the proposed iterative decoder.
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.
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.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This paper proposes a lightweight decentralized algorithm for localizing reactive jammers in wireless sensor networks. The algorithm uses a three step process: 1) anomaly detection to identify potential victim nodes, 2) estimation of jammer properties like jamming range, and 3) trigger identification where victim nodes test themselves to identify as trigger or non-trigger nodes. Theoretical analysis and simulation results show that the algorithm can accurately estimate jammer properties while maintaining low time and message complexity. It is also robust against advanced jamming models and provides benefits like improved routing compared to existing techniques.
Energy saving Wireless Sensor Networks using KerberosEditor IJCATR
The wireless sensor network is an networking field that combines sensing, computation, and communication into a single
tiny device. As sensor networks frame closer towards well-known deployment, security issues become a vital concern. So far, much
work has focused on making sensor networks realistic and useful, but still security in sensor network data communication is big issue
for research. This paper proposed the idea of having different Kerberos authentication architecture for the different clusters in sensor
network to save energy factor of the sensor nodes and to save time for data communication between the sensor nodes in the network
Performance Evaluation of Wormhole Attack In AODVIJERA Editor
The Mobile Ad hoc Networks (MANETs) is a collection of wireless nodes which interact with each other by sending packets to one another or on behalf of another node, without any central network infrastructure to control data routing. For communication, the nodes cooperatively forward data packets to other nodes in network by using the routing protocol. But, these routing protocols are not secure, thus paving the way for the MANET to be open to malicious attacks. A malicious attack which is commonly observed in MANET environment is wormhole attack. The objective of this work is to analyze the performance parameters of throughput, delay and packet loss in AODV with the existence of wormhole attack. Simulation results have shown that the performance parameters are affected very much when there is an attack due to wormholes
Preventing Malicious Node and Provide Secure Routing In ManetIOSR Journals
This document proposes SIEVE, a decentralized technique to identify malicious nodes in mobile ad hoc networks (MANETs). SIEVE uses rateless coding and the LT decoding process to detect corrupted data packets. It constructs a factor graph based on "checks" that nodes generate when decoding data. These checks contain information about which nodes provided packet data and whether the data was corrupted. SIEVE runs belief propagation on the factor graph to compute the probability that each node is malicious based on the checks. Simulation results show that SIEVE can accurately identify malicious nodes and is robust against various attacks, while having low computational and communication costs suitable for MANETs.
A New Programming Model to Simulate Wireless Sensor Networks : Finding The Be...IJCNCJournal
This document summarizes a research paper that proposes a new programming model for wireless sensor networks. The programming model aims to find the best routing path between sensor nodes by coding the actual sensor nodes to perform tasks. The paper reviews existing programming models and requirements for sensor network programming such as energy efficiency, scalability, localization, and time synchronization. It then describes the proposed model and compares results from applying the model in different network topologies using multiple routing algorithms.
AN EFFICIENT ANT BASED QOS AWARE INTELLIGENT TEMPORALLY ORDERED ROUTING ALGOR...IJCNCJournal
This document summarizes an ant-based routing algorithm for mobile ad hoc networks that aims to improve network lifetime, reduce packet loss, and decrease average end-to-end delay. It combines aspects of Ant Colony Optimization and the Temporally Ordered Routing Algorithm (TORA). The algorithm is designed to find multiple paths between sources and destinations in the network while satisfying quality of service constraints like delay, bandwidth, energy consumption, and data rate. It is claimed to be suitable for real-time and multimedia applications in mobile ad hoc networks.
IMPROVING IPV6 ADDRESSING TYPES AND SIZEIJCNCJournal
This document discusses proposed modifications to IPv6 addressing types and address size. It suggests that multicast addressing can mimic anycast and limited broadcast addressing, making those types unnecessary. It also proposes reducing the IPv6 address size from 128-bits to decrease packet overhead, while ensuring the new size supports future internet growth. A formula is presented to predict IP address exhaustion dates for different address sizes based on current usage and population projections.
An Optimal Software Framework for Parallel Computation of CRCIJCNCJournal
CRC is a common error detection method used in different areas such as information storage and data
communication. CRC depends on modulo-2 division by a predetermined divisor called the generator. In
this method, the transmitter divides the message by the generator and concatenates the calculated residue
to the message. CRC is not able to detect every kind of errors. The properties of the generator determine
the range of errors which are detectable in the receiver side. The division operation is currently performed
sequentially, so developing methods for parallel computation of the residue makes CRC suitable for
network protocols and software applications. This paper presents a novel software framework for parallel
computation of CRC using ODP polynomials.
EFFECT OF OPERATING WAVELENGTHS AND DIFFERENT WEATHER CONDITIONS ON PERFORMAN...IJCNCJournal
Free Space Optical (FSO) communication is a very recent and emerging technology to establish broadband
wireless data transmission system using modulated optical beams. The adoption of FSO system is mainly
needed when any physical connection between the transmitter and receiver is practically impossible and
where high bandwidth data transmission is expected. The performance of FSO communication technology
is highly dependent on atmospheric attenuation which is related to the visibility of the different weather
conditions as well as operating wavelengths. This paper presents our study about the effect of visibility as
well as operating wavelengths on atmospheric attenuation in different weather conditions for point-to-point
free space optical link. Moreover, it also discusses the methodology to find out the optimum link distance
for point-to-point FSO link which will be operated in different weather conditions. It is found that,
atmospheric attenuation is changed with the change in weather condition as well as operating wavelengths.
In this paper, three novel designs of broadband patch antenna are proposed. The first design propose
broadband slotted equilateral triangular patch antenna (ETPA) operating on frequency around 1800 MHz.
The second design propose broadband slotted right angle isosceles triangular patch antenna RAITPA operating on frequency around 2400 MHz. The third design proposes wideband V-Slotted and shorted edge ETPA antenna operating on frequency around 2400 MHz. The two powerful software HFSS and IE3D are used to simulate the proposed designs. Very good agreement between HFSS and IE3D software is obtained. The designs were chosen to fit modern wireless communication applications operate at Industrial Scientific Medical (ISM) bands such as Wireless local area networks (WLAN). Moreover, mounting the patch on thick substrate with loaded slot technique and loading the patch with a notch technique were used to enhance the bandwidth of those designs. Hence, large fractional bandwidth is obtained.
A distributed ip based telecommunication system using sipIJCNCJournal
Voice over Internet Protocol (VoIP) technologies are integral to modern telecommunications because of
their advanced features, flexibility, and economic benefits. Internet Service Providers initially promoted
these technologies by providing low cost local and international calling. At present, there is also a great
deal of interest in using IP-based technologies to replace traditional small and large office telephone
systems that use traditional PBX’s (Private Branch eXchange). Unfortunately, the large majority of the
emerging VoIP based office telephone systems have followed the centralized design of traditional public
and private telephone systems in which all the intelligence in the system is at the core, with quite expensive
hardware and software components and appropriate redundancy for adequate levels of reliability. In this
paper, it is argued that a centralized model for an IP-based telecommunications system fails to exploit the
full capabilities of Internet-inspired communications and that, very simple, inexpensive, elegant and
flexible solutions are possible by deliberately avoiding the centralized approach. This paper describes the
design, philosophy and implementation of a prototype for a fully distributed IP-based Telecommunication
System (IPTS) that provides the essential feature set for office and home telecommunications, including IPbased
long-distance and local calling, and with the support for video as well as data and text. The
prototype system was implemented with an Internet-inspired distributed design using open source software,
with appropriate customizations and configurations.
One of the important steps in routing is to find a feasible path based on the state information. In order to support real-time multimedia applications, the feasible path that satisfies one or more constraints has to be computed within a very short time. Therefore, the paper presents a genetic algorithm to solve the paths tree problem subject to cost constraints. The objective of the algorithm is to find the set of edges connecting all nodes such that the sum of the edge costs from the source (root) to each node is minimized. I.e. the path from the root to each node must be a minimum cost path connecting them. The algorithm has been applied on two sample networks, the first network with eight nodes, and the last one with eleven nodes to illustrate its efficiency.
DESIGNING SECURE CLUSTERING PROTOCOL WITH THE APPROACH OF REDUCING ENERGY CON...IJCNCJournal
The document describes a proposed secure clustering protocol for wireless sensor networks that aims to reduce energy consumption while satisfying security needs. The protocol has four phases: 1) Preparation, where keys are distributed and dynamic clusters are formed based on signal strength. Nodes send identifiers to the base station. 2) Aggregator selection, where a node is selected in each cluster as the data aggregator. 3) Data aggregation, where non-aggregator nodes send data to the aggregator node. 4) Data gathering, where aggregator nodes send aggregated data to the base station. The goal is to distribute workload, reduce transmissions, and hide the identities of aggregator nodes to protect against attacks.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
IDS IN TELECOMMUNICATION NETWORK USING PCAIJCNCJournal
This document summarizes a research paper that proposes using principal component analysis (PCA) as a dimension reduction technique for intrusion detection systems (IDS). The paper applies PCA to reduce the number of features from 41 to either 6 or 10 features for the NSL-KDD dataset. One reduced feature set is used to develop a network IDS with high detection success and rate, while the other is used for a host IDS also with good detection success and very high detection rate. The paper outlines the process of applying PCA for IDS, including performing PCA on training data to identify principal components, then using those components to map new online data and detect intrusions based on deviation thresholds.
This document discusses collision avoidance mechanisms in wireless ad hoc networks using distributed medium access control (MAC) protocols. It analyzes two main approaches for collision avoidance - out-of-band signaling using a busy tone, and an in-band handshaking approach using request-to-send and clear-to-send messages. The hidden node problem is a major cause of collisions at intermediate nodes in ad hoc networks, so the goal is to reduce collisions and improve transmission reliability. Algorithms for collision avoidance at intermediate nodes are presented for both the out-of-band and in-band approaches.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...cscpconf
1) The study compares the performance of Wu and Li's CDS creation algorithm and its location-based version under different MAC protocols and network sizes using simulation.
2) The results show that using the IEEE 802.11 MAC protocol leads to smaller CDS sizes, lower signaling overhead, and longer run times than the ideal MAC protocol, due to packet losses from collisions.
3) Packet losses prevent nodes from acquiring accurate neighborhood information, leading them to refrain from joining the CDS erroneously, not broadcast updates, and spend more time waiting for retransmissions.
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
Chapter 8 the role of networking in manufacturingN. A. Sutisna
This document discusses data communication and networking in manufacturing systems. It covers local area network concepts like topologies, protocols, and addressing. The most common high-level network topologies for manufacturing are bus structures and star networks. Bus networks offer flexibility in cable utilization but contention is an issue. Ring and star networks are also discussed along with techniques for resolving contention like CSMA/CD and token passing.
The document discusses ad hoc and sensor networks. It provides sample questions and answers related to various topics in this area. Some key points covered include:
- Characteristics of wireless channels include path loss, fading, interference, Doppler shift, and transmission rate constraints.
- Shannon's theorem states the maximum possible data rate on a noisy channel as a function of bandwidth and signal-to-noise ratio.
- An ad hoc network is a decentralized type of wireless network without any fixed infrastructure. It is suitable for situations where a wired network cannot be setup.
- Challenging issues in ad hoc network maintenance include medium access, routing, multicasting, transport layer protocols, pricing schemes, and quality of service
- Reservation schemes provide benefits like avoiding congestion and ensuring known waiting times by allocating transmission slots.
- MAC protocols should maximize channel utilization, support different traffic types, and adapt to equipment failures and changing conditions.
- CSMA/CD fails in wireless networks because collisions are detected at the receiver, not the sender, so the sender may not know a collision occurred.
- A "hidden terminal" refers to nodes that are in range of a receiver but not each other, so they cannot detect when the other is transmitting and collisions may occur.
This document summarizes a research paper that evaluates the performance of wired and wireless local area networks using simulation. It describes simulating Ethernet and IEEE 802.11 wireless LANs in OPNET with varying numbers of users. Key performance metrics for wired networks like collision count, throughput, and delay were analyzed. For wireless, metrics like data dropped, throughput, and access delay were studied. As the number of users increased, throughput decreased more for wireless than wired due to transmission limitations in wireless. The paper concludes wireless performs better than wired for small user numbers but degrades more with increasing loads.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
A computer network is network of computer .It connects multiple computer in manner to enable meaningful transmission and exchange of data among them.Main objective of CN is sharing of information ,resources and processing load among the connected computer.
you can easily get basic introduction of COMPUTER NETWORK
Computer networks allow interconnected computers to work together. They can be used for business applications using a client-server model, home networking, by mobile users, and raise social issues. The document discusses different types of network hardware including local area networks (LANs), metropolitan area networks (MANs), wide area networks (WANs), wireless networks, home networks, and internetworks. It also covers network software including protocol hierarchies, connection-oriented vs. connectionless services, service primitives, and the relationship between services and protocols.
Migrating packet dropping in mobile ad hoc network based on modified ack-base...Alexander Decker
This document discusses migrating packet dropping in mobile ad-hoc networks using a modified ACK-based authentication scheme. It begins by introducing mobile ad-hoc networks and some of the security challenges they face, such as packet dropping attacks. It then discusses existing ACK-based authentication schemes and their limitations, such as generating a large overhead and having ambiguity when nodes refuse acknowledgments. The document proposes a modified ACK-based scheme that uses a secure channel to overcome these limitations and minimize packet dropping. It evaluates the proposed scheme through simulation experiments and finds it improves performance metrics like packet delivery ratio and throughput compared to not using a secure channel. In conclusion, the modified scheme is presented as a way to enhance node authentication and reduce packet dropping in mobile
The document discusses the syllabus for a Mobile Computing course. It covers topics like introduction to mobile computing, mobile internet protocols, transport layer protocols, and MAC protocols. Key concepts explained include mobile IP, care-of addresses, tunneling, TCP, DHCP, classifications of MAC protocols like CSMA/CA and RTS/CTS. Questions at the end evaluate student understanding of these mobile computing fundamentals.
This document is a final report submitted by Ambreen Zafar for a course on advanced computer networks. It summarizes her simulation of routing misbehavior in mobile ad hoc networks (MANETs) using the NS-2 network simulator. The simulation categorized misbehaving nodes and used watchdog and path rater techniques to identify them and help routing protocols avoid these nodes. The simulation found that these techniques increased throughput by 17-27% in the presence of 40% misbehaving nodes, while increasing overhead transmissions from 9-12% up to 17-24%.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...ijasuc
The document presents a new Collision Based Contention (CBC) MAC protocol for mobile ad hoc networks.
The CBC protocol aims to improve throughput by dynamically adjusting the contention window size based on the current collision level, rather than using a fixed binary exponential backoff as in 802.11. Under CBC, the contention window is incremented or decremented by varying factors depending on the number of consecutive collisions or successes. This allows the window size to better reflect current network conditions compared to alternatives like MILD, MIMD, and AETF. Simulation results showed CBC outperforms 802.11 BEB and other proposals in terms of throughput, fairness, and delay.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
This document summarizes a study comparing the performance of the AODV and MAODV routing protocols in a mobile ad hoc network (MANET) using the Network Simulator 2 (NS-2). The study introduces a malicious node to simulate a hacker attack and analyzes the impact on packet delivery ratio, end-to-end delay, and throughput under different node densities and pause times. The results show that MAODV has lower performance than AODV, and the difference increases as the number of nodes increases due to the greater impact of the malicious node. Future work could extend the study to include more malicious nodes and design a new protocol to detect and mitigate malicious nodes.
Iaetsd enhancing vehicle to vehicle safety messageIaetsd Iaetsd
This document proposes a sublayer in the application layer of the WAVE stack to increase the reliability of safety message transmission in VANETs. It uses retransmission of network coded safety messages, which significantly improves overall reliability by handling synchronized collisions, congestion, and vehicle-to-vehicle channel loss. The sublayer transmits random linear combinations of received safety messages to help disseminate information. Simulations show the proposed method performs better than previous repetition-based algorithms in congested networks with high node densities.
Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode
allows all wireless devices within range of each other to discover and communicate in a peer-to-peer
fashion without involving central access points. Many routing protocols like AODV, DSR etc have been
proposed for these networks to find an end to end path between the nodes. These routing protocols are
prone to attacks by the malicious nodes. There is a need to detect and prevent these attacks in a timely
manner before destruction of network services.
Similar to Minimizing mobiles communication time using modified binary exponential backoff algorithm (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.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
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.
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...Zilliz
Join us to introduce Milvus Lite, a vector database that can run on notebooks and laptops, share the same API with Milvus, and integrate with every popular GenAI framework. This webinar is perfect for developers seeking easy-to-use, well-integrated vector databases for their GenAI apps.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Building RAG with self-deployed Milvus vector database and Snowpark Container...Zilliz
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
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
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.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Minimizing mobiles communication time using modified binary exponential backoff algorithm
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
MINIMIZING MOBILES COMMUNICATION TIME
USING MODIFIED BINARY EXPONENTIAL BACKOFF
ALGORITHM
Ibrahim Sayed Ahmad1, Ali Kalakech1, Seifedine Kadry2
1
Arts, Sciences and Technologies University, Lebanon
2
American University of the Middle East, Kuwait
ABSTRACT
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.
Binary Exponential Backoff (BEB) refers to a collision resolution mechanism used in random access MAC
protocols. This algorithm is used in Ethernet (IEEE 802.3) wired LANs. In Ethernet networks, this
algorithm is commonly used to schedule retransmissions after collisions.
The paper’s goal is to minimize the time transmission cycle of the information between mobiles moving in a
Wi-Fi by changing the BEB algorithm. The Protocol CSMA / CA manage access to the radio channel by
performing an arbitration based on time. This causes many problems in relation to time transmission
between mobiles moving in a cell 802.11. what we have done show that the protocol using CSMA / CA
access time believed rapidly when the number of stations and / or the network load increases or other
circumstances affects the network.
KEYWORDS
Network Protocols, Wireless Network, Binary Exponential Backoff.
1. INTRODUCTION
With wireless networking, you don’t need cables to connect your mobile devices. Instead,
wireless networks use radio waves to send and receive network signals. As a result, a mobile
device can connect to a wireless network at any location in your office.
DOI : 10.5121/ijcnc.2013.5605
85
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Wireless networks are especially useful for laptops, smartphones, and tablets. After all, the main
benefit of these devices is you can carry them around with you wherever you go. For example, at
work, you can use your laptop at your desk, in the conference room, in the break room, or even
out in the parking lot. With wireless networking, your portable devices can be connected to the
network no matter where you take it.
A wireless network is a network that uses radio signals rather than direct cable connections to
exchange information. An example of this kind of network includes devices from Dell’s
PowerConnect W-Series, powered by Aruba.
A computer with a wireless network connection is like a cellphone. Just as you don’t have to be
connected to a phone line to use a cell phone, you don’t have to be connected to a network cable
to use a wireless mobile device.
2. BINARY EXPONENTIAL BACKOFF
Classic Ethernet uses the 1-persistent CSMA/CD algorithm, this descriptor just means that
stations sense the medium when they have a frame to send and send the frame as soon as the
medium becomes idle. They monitor the channel for collisions as they send. If there is a collision,
they abort the transmission with a short jam signal and retransmit after a random interval. Let us
now see how the random interval is determined when a collision occurs, as it is a new method.
After a collision, time is divided into discrete slots whose length is equal to the worst-case
roundtrip propagation time on the ether (2τ). To accommodate the longest path allowed by
Ethernet, the slot time has been set to 512 bit times, or 51.2 µsec.
After the first collision, each station waits either 0 or 1 slot times at random before trying again. If
two stations collide and each one picks the same random number, they will collide again. After
the second collision, each one picks 0, 1, 2, or 3 at random and waits that number of slot times. If
a third collision occurs (the probability of this happening is 0.25), the next time the number of
slots to wait is chosen at random from the interval 0 to 23 − 1.
In general, after i collisions, a random number between 0 and 2i − 1 is chosen, and that number of
slots is skipped. However, after 10 collisions have been reached, the randomization interval is
frozen at a maximum of 1023 slots. After 16 collisions, the controller throws in the towel and
reports failure back to the computer. Further recovery is up to higher layers. This algorithm,
called binary exponential backoff, was chosen to dynamically adapt to the number of stations
trying to send. If the randomization interval for all collisions were 1023, the chance of two
stations colliding for a second time would be negligible, but the average wait after a collision
would be hundreds of slot times, introducing significant delay. On the other hand, if each station
always delayed for either 0 or 1 slot, then if 100 stations ever tried to send at once they would
collide over and over until 99 of them picked 1 and the remaining station picked 0. This might
take years. By having the randomization interval grow exponentially as more and more
consecutive collisions occur, the algorithm ensures a low delay when only a few stations collide
but also ensures that the collisions are resolved in a reasonable interval when many stations
collide. Truncating the backoff at 1023 keeps the bound from growing too large. If there is no
collision, the sender assumes that the frame was probably successfully delivered. That is, neither
CSMA/CD nor Ethernet provides acknowledgements. This choice is appropriate for wired and
optical fiber channels that have low error rates. Any errors that do occur must then be detected by
the CRC and recovered by higher layers. For wireless channels that have more errors, we will see
that acknowledgements are used. A flowchart representing the binary exponential back off
algorithm is given in Fig. 2
86
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 2: Binary exponential back off algorithm used in CSMA/CD
3. MODIFIED BEB ALGORITHM AND TOOLS USED
In this section, we will present tools used in our simulation and the implementation of the
changed BEB algorithm.
NS2 Simulator
Our simulation is done on NS2. Network simulator 2 or NS2 is an object-oriented discrete event
allows us to study the design and protocols for computer networks. It offers various facilities for
simulation of the protocols based on TCP, UDP, routing and multi-distribution (broadcast and
multicast) in the (wired or wireless) networks. This simulator is a free open source. NS2 is
developed in C++ which is a part of the VINT project (Virtual InterNetwork Testbed) is a joint
effort led by the University of Berkeley, USC / ISI (University of Southern California's
Information Sciences Institute), the LBL (Lawrence Berkeley National Laboratory) and Xerox
PARC. It is supported by DARPA (Defense Advanced Research Projects Agency). It uses IU
OTCL interpret. Through this language, the user can describe conditions of the simulation:
network topology, selected from a lot of physical links, used protocols, communications done,
etc.. The user can also create new objects in C++ and use them in NS by instantiations with
OTCL, the two languages C++ and OTCL have both very close hierarchies to each other. In NS2
several libraries are available and there are some specific needs for simulation of wireless
network and "multicast" communication [Opn07][Ane99][Ns07][Ns06][Luc03]. In our work we
use NS2 for its flexibility and the availability of its code [Ben07].
87
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Communication entity in NS2
The node (communicating entity) is the basic element of our model. A node in NS2 is a class
defined in OTCL which has three entities containing: the classifier, the link and the agent.
The classifier
The function of a node of the fields is examined by received packet, and more specifically, the
source address and destination address. According to contention losses, the node sends the packet
on its outgoing interfaces (Fig. 3). In NS2, then this is performed by an object called "Classifier".
There are several types of classification that are used for different purposes:
- "Address classifiers" is used to treat with unicast packets, and its role is directly to select
packets addresses, direct the node, and select the link to the next node.
- "Port classifier" its role is to select the agent to the packet which is intended.
- "Multicast classifier" is used to classify multicast packets.
The link
It is used to connect the nodes by each other (Fig. 3). A link is defined by several parameters
including: bandwidth, entry point, the lifetime of each packet, etc.. NS2 has several types of links,
so we can distinguish unidirectional links from bidirectional links and wired links to wireless
networks model without sound.
The Agent
Agents represent endpoints where packets in network layer are constructed and consumed. These
agents are the third component of the node. In NS2, the agent's role is to provide the destination
address; its function is to generate the packets and the interface to the application class (Fig. 3).
In NS2 there are several types of agents, each has a specifying role:
- TCP agent: for emitting TCP traffic
- UDP agent: for emitting UDP traffic
- TCPSink agent: for the receipt of TCP traffic
- NULL Agent for receiving UDP packets.
Figure 3 shows the Existing entities in a node and the links between ITS entities.
88
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 3: Diagram of a node in NS2.
4. TCL LANGUAGE
Tcl (originally from "Tool Command Language") is two things: a scripting language, and an
interpreter for that language that is designed to be easy to embed into our application. Tcl and its
associated graphical user-interface toolkit, Tk, were designed and crafted by Professor John
Ousterhout of the University of California, Berkeley. The Tcl interpreter has been ported from
UNIX to DOS, Windows, OS/2, NT, and Macintosh environments. The Tk toolkit has been
ported from the X window system to Windows and Macintosh.
5. AWK LANGUAGE
Awk is a programming language that handles several tasks, like mechanical data manipulation changing the format of data, checking its validity, finding items with some property, adding up
numbers, printing reports, and the like, with very short programs, often only one or two lines
long. An awk program is a sequence of patterns and actions that tell what to look for in the input
data and what to do when it's found. Awk examines a set of files for lines matched by any of the
patterns; when a corresponding line is found, the corresponding action is performed. A pattern
can select lines by combinations of regular expressions and comparison operations on strings,
numbers, fields, variables, and array elements.
Actions may perform arbitrary processing on selected lines; the action language looks like C but
there are no declarations, and strings and numbers are built-in data types.
6. SIMULATIONS
Configuration of communicating entities
Configuration of access point
The base station is configured as follows (Fig. 4)
89
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
$ Ns_ node-config-adhocRouting DSDV
•
•
•
•
•
•
•
llType-LL / / LL layertype
macType Mac/802_11 / / type of the MAC layer
IfqLen 800 / / length of the tail
antType Antenna / OmniAntenna / / type of antenna
phyType Phy / WirelessPhy / / type of physical layer
channelType Channel / WirelessChannel / / type of channel
wiredRouting ON / / Wired link with other AP's.
In this list we find the basic configurations of the AP. (Type of MAC and physical layer,
antenna type...). Figure 4 describes entities used for the AP (agents, links, and classifiers).
Figure 4: Figure of base station
Configuration of mobile nodes
The nodes are moving in the Mi cell base station where each node has a unicast address and
exchange packets with other mobile station through the base station. In each node there exist
a single wireless link but there are two agents (Fig. 5):
•
•
An agent to send UDP packets (UDP Because in Our case, we use UDP only)
A null Agent to Receive UDP packets.
These nodes operates in the cell of an access point to which they are attached as shown in Fig
5.
90
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 5: Diagram of the mobile node
General parameters
The general parameters of this simulation are given in (table 1). These parameters for the
simulation model are compatible with the measure made.
Table 1: Simulation Parameters
CBR Packet Size
210 bytes
CWMin
31 ms
CWMax
1023 ms
SIFS
0.000010 s
SlotTime
0.000020 s
CBR rate
448Kb
7. MODELING THE METHODS OF BACK-OFF
We will now describe the numerical experiments to adjust the simulation parameters “a” and “b”
of the back-off algorithm.
The purpose of this simulation is to study the effect of the load (by changing the number of
mobiles) on the transmission time for different values of parameters: “a” and “b”. Our approach is
based on cooperation involving the mobiles in the cell, by pairs, and each pair in the cell transmits
CBR traffic to other one during a specified time.
Our simulation protocol is the following: We will evaluate the changes in throughput and end to
end delay while changing “a” and “b” and the number of nodes in the cell. To increase the cell
load, we increase the number of mobiles in introducing new pairs (the mobile communicates with
other in pairs), each forming a cooperation group. In the example in (Figure 6) it is pair M5 - M6.
For each simulation we vary the values of “a” and “b”. All these mobiles broadcast via the AP (in
pairs) according to NS2 simulation parameters mentioned above.
91
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
If D is the transmission delay between mobile references, it can be defined as time between
sending the message (Temis) and corresponding time to receive the message by the mobile
receiver Trec: D= Max(Trec - Temis )
It should be noted that this simulation will help us to find the optimal values of “a” and “b” by
changing the Back-off algorithm.The figure below describes our work
Figure 6: Principle of simulation used to assess the changed Back-off
8. IMPLEMENTATION OF THE MODIFIED BEB
In fact the back-off algorithm BEB is implemented in standard NS2. To implement our
"modified" algorithm of Back-off algorithm it is sufficient to act on some files in the hierarchy of
NS2 MAC layer. We show this hierarchy in the (Figure 7).
92
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 7: Hierarchy of NS2 MAC layer [Ns06].
After the study of this hierarchy, we decided to modify the code in C++ functions included in in
the following files:
•
•
•
•
•
tcl/lan/ns-mac.tcl.
tcl/lib/ns-lib.tcl.
Mac/mac-802_11.h.
Mac/mac-802_11.cc.
tcl/lib/ns-default.tcl.
We want to change the formula of Back-off as follows:
On failure of transmission: CW = min (a.CW, CWmax)
and each successful transmission, we decrement the value of CW by value b.
CW = max (CW-b, CWmin)
To make these changes we use the C++ of NS2 and we change the File Mac/Mac-802_11.hh as
follows:
In
case
of
transmission
failure,
we
modified
the
inc_cw() function by setting CW=min(a* CW,CWmax), a is initialized with a value taken from
the interval [1,3].
Original Function:
inline void inc_cw()
{
cw_ = (cw_ << 1) + 1;
if(cw_ > phymib_.getCWMax())
cw_ = phymib_.getCWMax();
}
93
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Modified one:
inline void inc_cw()
{
cw_= min((u_int32_t)(phymib_.geta()*cw_),phymib_.getCWMax());
}
In case of successful transmission, we modified the rst_cw() method by setting
CW=max(CWmin, CW-b) instead of CW = CWmin.
Original Function:
inline void rst_cw()
{
cw_ = phymib_.getCWMin();
}
Modified Function:
inline void rst_cw()
{
cw_= max(phymib_.getCWMin(),(u_int32_t)(cw_- phymib_.getb()));
}
9. SCENARIO OF SIMULATION
We calculate the average transmission time between all mobiles during a time interval T = 120s
for which the cell load remains constant.
To find the best values of “a” and “b”, we vary b in the interval [0, 10] steping 1 each time and
for each b, value varies in interval [1, 3] steping 0.1 each time. The results obtained at the end of
the simulations corresponding to different values of “a” and “b” will allow us to choose their
optimal values. The optimum means here leading the minimum transmission delay, and
maximum throughput.
The following flowchart (Figure 8) describes the scenario simulation and the increment of “a”
and “b”.
94
11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
B=0
B+=1
B<1
1
A=1
A<3.
A+=0.
Figure 8: Algorithm of evaluating (a, b) values of Back-off changed.
9. ANALYSIS OF RESULTS AND VALIDATION
In this section, we present the results obtained by changing the mechanism of Back-off. First we
present test result for base BEB and the modified BEB with the same scenario mentioned in
chapter 3 but during a period of 2s and not 120s for testing purposes. Second we present the
results of our end simulation and obtaining the optimum values of “a” and “b”.
Before applying the new algorithm we make a simulation test to get results in order to proof that
the new added parameters in ns2 files takes effect. The test is applied with the parameters
mentioned in the previous chapter but during a period of 2 s only. The BEB algorithm without
change has a=2 since when a failer transmission happens the contention window is doubled that’s
means multiplied by 2 leading to a=2 but when a successful transmission occur cw returns to
cwmin and in our algorithm cw will be the maximum between cwmin and cw-b for this reason we
cannot deduce b but we will do the simulation assuming b is 0 and table 5.1 shows the results
which proves the effect of the new algorithm on throughput and delay.
95
12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Table 2: Comparing results between old and new algorithm
Throughput Modified
Algorithm
n=6
n=10
n=30
Delay Modified Algorithm
n=6
n=10
n=30
Throughput UNModified
Algorithm
n=6
n=10
n=30
Delay UNModified
Algorithm
n=6
n=10
n=30
b
0
0
0
T.
RecvByte
6.64
6.79
4.64
Throuput
435.63
445.97
304.84
r/s
0.19
0.11
0.02
a
2
2
2
b
0
0
0
Packet
Delivery
Ratio
19.3
10.98
2.33
Total
Dropped
Packets
177
453
2531
Average End-to-End
Delay
308.33 ms
317.53 ms
335.18 ms
a
2
2
2
b
0
0
0
T.
RecvByte
7
6.9
4.61
Throuput
459.83
452.06
302.61
r/s
0.2
0.11
0.02
b
0
0
0
Packet
Delivery
Ratio
20.34
11.14
2.32
Total
Dropped
Packets
174
544
2573
Average End-to-End
Delay
355.53 ms
388.19 ms
417.30 ms
a
2
2
2
a
2
2
2
10. NEW BEB ANALYSIS AND RESULT
Our goal is to make several simulations by changing the values of “a” and “b” in modified Backoff mechanism. In each simulation, we measure the transmission time between each two mobiles
and calculate the average end to end delay of communicating mobiles, besides we calculate the
throughput by measuring the total transmitted bits during a specified period of time (simulation
period).
Our goal is to choose the optimal values of “a” and “b”, which gives:
- The minimum transmission time
- Maximum capacity.
For this, we made 21 x 11 simulations for the values of “a” and “b”. We present in the appendix
A the tables of the results obtained for throughput and for end to end delay for which we can
choose the optimal values of “a” and “b”. Figurs 9, 10, 11, 12, 13, 14 shows these results
graphicaly.
96
13. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 9: Throughput for no. of nodes =6
Figure 10: Throughput for no. of nodes =10
97
14. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 11: Throughput for no. of nodes =30
Figure 12: End to end Delay for no. of nodes =6
98
15. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 13: End to end Delay for no. of nodes =10
Figure 14: End to end Delay for no. of nodes =30
According to the graphs shown and the tables in Appendix A we deduce that the optimum values
of “a” and “b” are:
According to throughput measurement:
1
2
For n=6: a=1.1, b=1
For n=10: a=1.2, b=3
99
16. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
3
For n=30: a=1.4, b=6
According to delay measurement:
1
For n=6: a=1.2, b=2
2
For n=10: a=1.2, b=2
3
For n=30: a=1.1, b=4
The simuation result lead us to more than one optimum values of “a” and “b” according to
circumstances the network based on.
11. GENERAL CONCLUSION
This paper aims to minimize the delay time through wireless communication by changing the
BEB algorithm. The Protocol CSMA / CA is a protocol that manages access to the radio channel
by performing an arbitration based on time. This causes many problems in relation to time
transmission between mobiles moving in a cell 802.11. what we have done show that the protocol
using CSMA / CA access time believed rapidly when the number of stations and / or the network
load increases or other circumstances affects the network.
Our objective is to minimize the time transmission cycle of the information between mobiles
moving in a Wi-Fi. We reach our solution by changing two main functions in the BEB algorithm
and our study proves that the changes we made give an acceptable result. We made the simulation
according to variable number of nodes and for each one we get a new values of “a” and “b”.
Future studies will be to create a fuzzy logic function to make choice of the optimum values of
“a” and “b” according to specific rules and parameters.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[Ahm99]H. Ahmadi, A. Krishna, and R.O. LaMaire, « Design issues in wireless LANs”, Journal of
High Speed Networks, Personal Wireless Communication, 1999.
[Ane99]P. Anelli, E. Horlait, « Ns-2: principle », version 1.3, 1999.
[Ben07]Sabri Benfarhat, « rapport interne équipe réseau et protocole », LIMOS, Clermont Ferrand,
2007.
[Bia00]Giuseppe Bianchi, “Performance Anaylsis of the IEEE 802.11 Distributed Coordination
Function”, IEEE Journal on Selected Areas in Communications, Vol. 18, Number 3, March 2000.
[Bia96]Giuseppe Bianchi, Luigi Fratta, Matteo Oliveri, “Performance evaluation and enhancement of
the CSMA/CA MAC protocol for 802.11 wireless LANs”, in: Proc. of IEEE PIMRC'96, October
1996.
[Bin02]Benny Bing, “Wireless Local Area Networks”, Wiley-Interscience, 2002.
[Bou04]Pierre-Olivier BOURGEOIS - Alexis MARCOU, « Security of IEEE 802.11 », août 2004.
[Byu05]Byung-Jae Kwak, Nah-Oak Song, Miller, “Performance analysis of exponential backoff”,
Networking, IEEE/ACM Transactions on , volume 13, issue 2, april 2005.
[Car03]M. M. Carvalho, J. J. Garcia-Luna-Aceves, “Delay analysis of IEEE 802.11 in single-hop
networks”, Proc. of IEEE ICNP, Nov. 2003.
[Car06]Carlos Cardeira, Ronald Schoop, « Automation of wireless networks », Jautomatise N° 48 Septembre-Octobre 2006.
[Cha04]Chae Y. Lee, Hee K. Cho, “Multiple multicast tree allocation in IP network”, Computers &
Operations Research, Volume 31, Issue 7, June 2004.
[Che98]K. Cheun and S. Kim, “Joint delay-power capture in spread-spectrum packet radio networks”.
IEEE Transaction on Communications, 1998.
[Chi06]J. Chittamuru, A. Ramanathan, M. Sinha, “Simulation of Point Coordination Function for
IEEE 802.11 Wireless LAN using Glomosim”, 2006.
[Chu05]Chunyu Hu, Hwangnam Kim, and Jennifer C. Hou, “An Analysis of the Binary Exponential
Backoff Algorithm in Distributed MAC Protocols”,UIUCDCS-R-2005-2599 (UILU-ENG-20051794), July 2005.
100
17. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
[15] [Cirr02]“Wireless Communications for Industrial Applications”, Cirronet White Paper, Summer
2002.
[16] [Dev93]Daniel DEVARSIRVATHAM, Theodore RAPPAPORT, “Radiowave propagation
measurements & modeling for personal communications”, Tutorial 4, IEEE International Conference
on Communications ICC’93, Geneva, Switzerland, May 27, 1993.
[17] [Ebe00]Jean-pierre Ebert, Adam Wolisz, “A performance comparison of point and distributed
coordination function”, MOMUC, 2000.
[18] [Erg04]Sinem Coleri Ergen, “ZigBee/IEEE 802.15.4 Summary”, Berkeley, September 2004
[19] [Fah05]FAHS Walid, BAKHACHE Bacem , JACQUET Frédérique, MISSON Michel, « Stratégies
de Multicast contraint par le temps au sein d'un WLAN », JDIR 2005, proceeding P.108-115.
[20] [Fah06a]Walid Fahs, Bassem Bakhache, Frédérique Jacquet, Michel MISSON, “Multicast Strategies
for Robots moving within the coverage of a WLAN”, VTC Fall 2006, Canada.
[21] [Fah06b]W. Fahs, B.Bakhache, M. Misson, and F. Jacquet, “Study of a Wireless Medium Access
Method inspired from PCF for industrial applications”, IEEE ICTTA Spring 2006,Ref. ICTTA405.
[22] [Far06]Jahanzeb Farooq, Bilal Rauf, “Implementation and Evaluation of IEEE 802.11e Wireless LAN
.in GloMoSim”, rapport de master, 2006
[23] [Fre95]Antonio FREITAS, « Etude de la transposition de la méthode d’accès « jeton sur bus» pour un
réseau de stations nomades dialoguant par infrarouge dans une configuration multisauts », Thèse de
Doctorat, Université Blaise Pascal, 1995.
[24] [Fri46]Friis, H.T., “A Note on a Simple Transmission Formula”, 1946.
[25] [Ger91]E. Geraniotis and M. Soroushnejad, “Probability of Capture and Rejection of Primary
Multiple Access Interference in Spread Spectrum Networks”, IEEE Trans.on Communications, 39(6),
1991.
[26] [Gou67]G. Goudet, « applications des équations de Maxwell », éditions Masson 1967.
[27] [Goo88]Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March, “Stability of binary
exponential backoff”, Journal of the ACM (JACM), Volume 35 , Issue 3 (July 1988) Pages: 579 - 602
.
[28] [Har04]Lawrence J. Harte, “Introduction to Bluetooth, Technology, Market, Operation, Profiles, and
Services”, Althos Publeshing, 2004.
[29] [Her04]Sébastien Hernandez, Patrick Lafargette, Antonio Freitas, Michel Misson, “FIRST
evaluations of a simulation Architecture of the Use of an IEEE 802.11 WLAN in industrial Context”,
IEEE Wireless Communications and networking conference, Atlanta 2004.
[30] [Her06]Sebastien Hernandez, Evaluation et optimisation du mécanisme de ‘Handover’ dans un réseau
local sans fil dédié aux applications à trafic contraint par le temps, Thèse de Doctorat, Université
Blaise Pascal, 2006.
[31] [Hpl07]http://www.hpl.hp.com/personal/Jean_Tourrilhes.
[32] [Iee97]IEEE 802.11-1997, “Wireless LAN Medium Access Control (MAC) and Physical Layer
(PHY)”, 1997.
[33] [Itu05]Recommendation ITU-R P.1238-4, “Propagation data and prediction method for the planning
of indoor radio communication systems and local area networks in the frequency range of 900 MHz to
100 GHz”, 2005.
[34] [Ixa06]http://www.ixarm.com/Fiche-industrie-de-CYBERNETIX.
[35] [Jac04]F.Jacquet, P.Lafargette, P. Llamas, M.Misson, “A multicast Approach for exchange between
co-operating mobiles in an 802.11 WLAN”, The 8th Multi-Conference on systemic cybernetics and
informatics SCI 2004, Proceeding, pp 7-12, Orlando, USA 2004.
[36] [Lep91]F.LEPAGE et al., « Local industrial applications », 2nd edition, HERMES,1991.
[37] [Liu00]Jane W. S. Liu, “Real-Time Systems, University of Ilinois at Urbana-hampaign”, Person
education, 2000.
[38] [Luc03]Gilberto flores Lucio, Marcos Paredes-Farrera, Emmanuel Jammeh, Martin Fleury,Martin
J.Reed, Opnet Modeler and NS2: comparing the accuracy of network simulator for packet-level
analysis using a network testbed, WSEAS Transactions on Computers, Issue 3,Volume 2:700-707
July 2003.
[39] [Man05]Saher S. Manaseer, Mohamed Ould-Khaoua, “Logarithmic Based Backoff Algorithm for
MAC Protocol in MANETs”, 2005.
[40] [Mar02]P. S. Marshall; “Industrial Ethernet”, ISA Press, (ISBN 1-55617-869-7), 2002.
[41] [Mcc06]Patrick McCurdy, Ira Sharp, “Exploring New Wireless Technologies for Industrial
Applications”, Presented at ISA Expo 2006.
101
18. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
[42] [Met76]J.J. Metzner, “On improving utilization in ALOHA networks”. IEEE Trans. Commun., page
447,1976.
[43] [Mis05]Michel Misson, cours de Master Réseau, 2005.
[44] [Muh02]Paul Mühlethaler, « 802.11 et les réseaux sans fil », Eyrolles, 2002.
[45] [Mut89]K. Mutsuura, H. Okada, K. Ohtsuki, and Y. Tezuka, “A New control scheme with capture
effect for random access packet communications”, In Proc. IEEE GLOBECOM, page 938, 1989.
[46] [Nak05]Nakjung Choi, Yongho Seok, Yanghee Choi, Sungmann Kim, Hanwook Jung, “Enhanced
backoff scheme for the IEEE 802.11 DCF”, Vehicular Technology Conference,2005. VTC 2005Spring.Volume 3, Issue , 30 May-1 June 2005 Page(s): 2067 - 2070 Vol. 3.
[47] [Ns06 ]Tutorial for the Network Simulator NS, http://www.isi.edu/nsnam/ns/tutorial/,2006.
[48] [Ns07] http://www.isi.edu/nsnam/ns/.
[49] [Oba98]Shuichi Obayashi, “A Body-Shadowing Model for Indoor Radio Communication
Environments”, 1998.
[50] [Opn07]www.opnet.com.
[51] [Pil04]Jean-François Pillou, « introduction to Wifi (802.11) », 2004.
[52] [Pro07]John G. Proakis, Massoud Salehi, “Digital communications”, McGraw Hill Higher Education,
2007
[53] [Rap96]T. S. Rappaport, “Wireless communications, principles and practice”, Prentice Hall,1996.
[54] [Sta01]William Stalling, “Local Networks”, Sixth Edition, Macmillan, 2001.
[55] [Std99]SO/IEC Std 8802-11, “Wireless LAN Medium Access Control (MAC) and Physical Layer
(PHY) specification”, 1999.
[56] [Tia03]Tian, S. Csaba, T. Lohmar, H.-Y. Lach, R. Tafazolli, C. Janneteau, “comparison of three
approaches towards mobile multicast”, Y. IST Mobile Summit 2003, Aveiro, Portugal,16-18 June
2003.
[57] [Vas04]A. Vasan, A. Kochut, and A. U. Shankar, “Sniffing out the correct Physical Layer Capture
model in 802.11b”, Technical Report UMIACS-TR-2004-26 and CS-TR-4583,Department of
Computer Science, University of Maryland College Park, April 2004.
[58] [Vel03]Hadzi-Velkov, Z., Spasenovski, B., “An analysis of CSMA/CA protocol with capture in
wireless LANs”, Wireless Communications, March 2003.
[59] [War01]C. Ware, J.F. Chicharo, and T. Wysocki, “Modelling of capture behaviour in ieee 802.11
radio modems”, IEEE International Conference on Telecommunications, 2001.
102