The document analyzes and compares the performance of two Medium Access Control (MAC) protocols for wireless sensor networks: Sensor MAC (S-MAC) and Hybrid MAC (H-MAC).
[1] S-MAC is a contention-based protocol that reduces energy waste from idle listening by implementing synchronized sleep and listen schedules. Nodes form virtual clusters to wake up and communicate at the same time. H-MAC improves on this with a slotted frame structure that dynamically allocates slots.
[2] The performance of the two protocols is evaluated based on end-to-end delay, packet delivery ratio, packet drop rate, and energy consumption using the NS2 simulation tool.
[3] Spatial correlation
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Purpose is to conserve the transmitted energy
from various sensor nodes. Various energy efficient algorithms have been designed for this. LEACH uses
distributed cluster formation & randomized rotation of the cluster head to minimize the network energy
consumption. Our paper is proposing an algorithm which is the enhancement of existing IB-LEACH. It reduces the energy consumption by using energy bank. This energy bank stores the energy after each round in both routing and clustering phase which overall increases the life time of the network. In this
approach, ACTIVE_ROUTE_TIMEOUT is also enhanced by shamming the static parameters of HELLO_INTERVAL, RREQ_RETRIES and NET_DIAMETER. Results are compared through MATLAB and provide better approach than previous ones.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Purpose is to conserve the transmitted energy
from various sensor nodes. Various energy efficient algorithms have been designed for this. LEACH uses
distributed cluster formation & randomized rotation of the cluster head to minimize the network energy
consumption. Our paper is proposing an algorithm which is the enhancement of existing IB-LEACH. It reduces the energy consumption by using energy bank. This energy bank stores the energy after each round in both routing and clustering phase which overall increases the life time of the network. In this
approach, ACTIVE_ROUTE_TIMEOUT is also enhanced by shamming the static parameters of HELLO_INTERVAL, RREQ_RETRIES and NET_DIAMETER. Results are compared through MATLAB and provide better approach than previous ones.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of
potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make
implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been
proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages;
however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm;
however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we
compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC
protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use
of a virtual ideal MAC enables us to investigate how the real-world performance of these
algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
Power Optimization Technique for Sensor NetworkEditor IJCATR
In this paper different power optimization techniques for wireless sensor network is proposed and compared. The
energy conservation in a wireless sensor network is of great significance and very essential. The nodes in a wireless environment are
subject to less transmission capabilities and limited battery resources. There are several issues that constrain the WSNs and challenges
posed by the environment of handling traffic and the lifetime of the battery in the nodes. The battery of node is energy limited and is
not convenient to be replaced by the restriction of circumstance. But we have to ensure that even the slightest of energy is utilized and
the overall power conserved in a wireless environment is greatly reduced. This paper aims to reduce the power conservation in a
wireless sensor network using Dijkstra‘s algorithm, with a set of optimal path and available idle nodes.
This paper proposes medium access control (MAC) layer protocol for wireless sensor networks.
Sensor nodes are battery operated so the energy efficiency is an important aspect for the wireless sensor
networks WSNs. The protocol aims for achieving energy efficiency to increases network lifetime and
scalability to increase the network capacity. Clustering, synchronization and low duty cycle are some of
the characteristics for utilizing energy efficiently in the network. The protocol is designed with having the
schedules of the clusters to be overlapped in a low duty cycle operation. We have evaluated the
performance of protocol through detailed ns- 2 simulation. The simulation results show that this protocol
outperforms when compared to SMAC. It has reduced schedule updates, power consumption and data
loss.
.
Keywords— Wireless sensor networks, duty-cycle, clustering, schedule, synchronization, energyefficiency
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTINGIJCNCJournal
The rapid growth of users on the cloud service and number of services to the user increases the load on the
servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used
effectively a load balancing technique not only to balance the resources for servers but also reduce the
negative impact to the end-user service. The current, load balancing techniques have solved the various
problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast
for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The
study of improving these parameters have great significance to improving system performance through
load balancing. From there, we can propose more effective methods of load balancing, in order to increase
system performance. Therefore, in this paper we researched some parameters affecting the performance
load balancing on the cloud computing.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
NAT has been design to work with Internet client-server structure. The emerged of Peer-to-Peer (P2P)
networks and applications revealed the incompatibility between P2P applications and NAT. Many methods
has been developed and implemented to solve connectivity between peers behind NAT devices.
Nevertheless, various NATing types can’t communicate with one another. In this work, we are going to
study the impact of NAT types on the start-up delay time of peers in P2P streaming systems. We will
demonstrate the ability of NATing to expel peers in P2P live streaming systems. A new neighbour selecting
algorithm will be proposed. This algorithm will utilize NAT-types configurations as a parameter. We have
utilized NS2 simulator to show the performance of the new algorithm in increasing the connectivity,
reducing the number of expelled peers and implementing of locality.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of
potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make
implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been
proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages;
however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm;
however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we
compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC
protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use
of a virtual ideal MAC enables us to investigate how the real-world performance of these
algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
Power Optimization Technique for Sensor NetworkEditor IJCATR
In this paper different power optimization techniques for wireless sensor network is proposed and compared. The
energy conservation in a wireless sensor network is of great significance and very essential. The nodes in a wireless environment are
subject to less transmission capabilities and limited battery resources. There are several issues that constrain the WSNs and challenges
posed by the environment of handling traffic and the lifetime of the battery in the nodes. The battery of node is energy limited and is
not convenient to be replaced by the restriction of circumstance. But we have to ensure that even the slightest of energy is utilized and
the overall power conserved in a wireless environment is greatly reduced. This paper aims to reduce the power conservation in a
wireless sensor network using Dijkstra‘s algorithm, with a set of optimal path and available idle nodes.
This paper proposes medium access control (MAC) layer protocol for wireless sensor networks.
Sensor nodes are battery operated so the energy efficiency is an important aspect for the wireless sensor
networks WSNs. The protocol aims for achieving energy efficiency to increases network lifetime and
scalability to increase the network capacity. Clustering, synchronization and low duty cycle are some of
the characteristics for utilizing energy efficiently in the network. The protocol is designed with having the
schedules of the clusters to be overlapped in a low duty cycle operation. We have evaluated the
performance of protocol through detailed ns- 2 simulation. The simulation results show that this protocol
outperforms when compared to SMAC. It has reduced schedule updates, power consumption and data
loss.
.
Keywords— Wireless sensor networks, duty-cycle, clustering, schedule, synchronization, energyefficiency
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTINGIJCNCJournal
The rapid growth of users on the cloud service and number of services to the user increases the load on the
servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used
effectively a load balancing technique not only to balance the resources for servers but also reduce the
negative impact to the end-user service. The current, load balancing techniques have solved the various
problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast
for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The
study of improving these parameters have great significance to improving system performance through
load balancing. From there, we can propose more effective methods of load balancing, in order to increase
system performance. Therefore, in this paper we researched some parameters affecting the performance
load balancing on the cloud computing.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
NAT has been design to work with Internet client-server structure. The emerged of Peer-to-Peer (P2P)
networks and applications revealed the incompatibility between P2P applications and NAT. Many methods
has been developed and implemented to solve connectivity between peers behind NAT devices.
Nevertheless, various NATing types can’t communicate with one another. In this work, we are going to
study the impact of NAT types on the start-up delay time of peers in P2P streaming systems. We will
demonstrate the ability of NATing to expel peers in P2P live streaming systems. A new neighbour selecting
algorithm will be proposed. This algorithm will utilize NAT-types configurations as a parameter. We have
utilized NS2 simulator to show the performance of the new algorithm in increasing the connectivity,
reducing the number of expelled peers and implementing of locality.
Probability Density Functions of the Packet Length for Computer Networks With...IJCNCJournal
The research on Internet traffic classification and identification, with application on prevention of attacks
and intrusions, increased considerably in the past years. Strategies based on statistical characteristics of
the Internet traffic, that use parameters such as packet length (size) and inter-arrival time and their
probability density functions, are popular. This paper presents a new statistical modeling for packet length,
which shows that it can be modeled using a probability density function that involves a normal or a beta
distribution, according to the traffic generated by the users. The proposed functions has parameters that
depend on the type of traffic and can be used as part of an Internet traffic classification and identification
strategy. The models can be used to compare, simulate and estimate the computer network traffic, as well
as to generate synthetic traffic and estimate the packets processing capacity of Internet routers
A FRAMEWORK FOR SOFTWARE-AS-A-SERVICE SELECTION AND PROVISIONINGIJCNCJournal
As cloud computing is increasingly transforming the information technology landscape, organizations and
businesses are exhibiting strong interest in Software-as-a-Service (SaaS) offerings that can help them
increase business agility and reduce their operational costs. They increasingly demand services that can
meet their functional and non-functional requirements. Given the plethora and the variety of SaaS
offerings, we propose, in this paper, a framework for SaaS provisioning, which relies on brokered Service
Level agreements (SLAs), between service consumers and SaaS providers. The Cloud Service Broker (CSB)
helps service consumers find the right SaaS providers that can fulfil their functional and non-functional
requirements. The proposed selection algorithm ranks potential SaaS providers by matching their offerings
against the requirements of the service consumer using an aggregate utility function. Furthermore, the CSB
is in charge of conducting SLA negotiation with selected SaaS providers, on behalf of service consumers,
and performing SLA compliance monitoring
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
Performance comparison of aodv and olsr using 802.11 a and dsrc (802.11p) pro...IJCNCJournal
A Vehicular Ad Hoc Network (VANET) is a network formed purely among vehicles without presence of any
communication infrastructure as base stations and/or access point. Frequent topological changes due to
high mobility is one of the main issues in VANETs. In this paper we evaluate Ad-hoc On-Demand Distance
Vector (AODV) and Optimized Link State Routing (OLSR) routing protocols using 802.11a and 802.11p in
a realistic urban scenario. For this comparison, we chose five performance metrics: Path Availability, Endto-
End Delay, Number of Created Paths, Path Length and Path Duration. Simulation results show, that for
most of the metrics evaluated, OLSR outperforms AODV when 802.11p and that 802.11p is more efficient
in urban VANETs.
Mesh pull backup parent pools for video-on-demand multicast treesIJCNCJournal
Resilient multicast is a challenging issue for overlay trees particularly because of high churn. In this work,
we propose a mechanism that allows scalable video multicast. While the regular operation involves treepush
of the video, any node that looses its parent on the tree solicits video from a predetermined backup set
of nodes in a mesh-pull fashion. The main idea is to allocate less bandwidth for backup to improve
bandwidth utilization while maintaining the best possible video quality. The choice of essential design
parameters are studied together with seamlessness of the streaming under variety of fault scenarios.
Simulation results indicate the optimality of the proposed approach as far as resiliency, bandwidth
utilization, delay and video quality are concerned.
Reducing the Peak to Average Power Ratio of Mimo-Ofdm SystemsIJCNCJournal
In this paper, we proposed a particle swarm optimization (PSO) based partial transmit sequence (PTS)
technique in order to achieve the lowest Peak-to-Average Power Ratio(PAPR) in Multiple Input Multiple
Output- Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems. Our approach consist of
applying the PSO based PTS on each antenna of the system in order to find the optimal phase factors,
which is a straightforward method to get the minimum PAPR in such a system. The simulation results
demonstrate that the PSO based PTS algorithm when applied to MIMO-OFDM systems with a wide range
of phase factors, tends to give a high performance. In addition, there is no need to increase the number of
particles of the PSO algorithm to enhance the performance of the system. As a result of this, the complexity
of finding the minimum PAPR is kept at a reasonable level.
A Compact Dual Band Dielectric Resonator Antenna For Wireless ApplicationsIJCNCJournal
This paper presents the design of a dual band rectangular Dielectric Resonator Antenna (DRA)
coupled to narrow slot aperture that is fed by microstrip line. The fundamental TE111 mode and
higher-order TE113 mode are excited with their resonant frequencies respectively. These
frequencies can be controlled by changing the DRA dimensions. A dielectric resonator with high
permittivity is used to miniaturize the global structure. The proposed antenna is designed to have
dual band operation suitable for both DCS (1710 - 1880 MHz) and WLAN (2400 - 2484 MHz)
applications. The return loss, radiation pattern and gain of the proposed antenna are evaluated.
Reasonable agreement between simulation and experimental results is obtained.
A multi tenant platform for sms integrated servicesIJCNCJournal
This paper presents the design and development of a Linux based infrastructure and platform for a
wholesale service provider to offer SMS integrated services to retail providers for resale. The multi-tenant
platform, capable of providing multiple types of SMS integrated services, was designed and built mainly
with off-the-shelf components and open source software. The platform is highly reliable and flexible,
enabling fast provision of customisable services by integrating SMS, voice, VoIP, and web services in
innovative ways. This paper describes the design of the platform and presents four major application areas.
Osc mac duty cycle with multi helpers ct mode wi-lem technology in wireless s...ijwmn
Recently, Wireless Sensor Networks (WSNs) grow to be one of the dominant technology trends; new needs
are continuously emerging and demanding more complex constraints in a duty cycle, such as extend the life
time communication . The MAC layer plays a crucial role in these networks; it controls the communication
module and manages the medium sharing. In this work we use OSC-MAC tackles combining with the
performance of cooperative transmission (CT) in multi-hop WSN and the Wi-Lem technology
Comparison of Csma Based MAC Protocols of Wireless Sensor Networkspijans
Energy conservation has been an important area of interest in Wireless Sensor networks (WSNs). Medium
Access Control (MAC) protocols play an important role in energy conservation. In this paper, we describe
CSMA based MAC protocols for WSN and analyze the simulation results of these protocols. We
implemented S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware. Previous surveys mainly
focused on the classification of MAC protocols according to the techniques being used or problem dealt
with and presented a theoretical evaluation of protocols. This paper presents the comparative study of
CSMA based protocols for WSNs, showing which MAC protocol is suitable in a particular environment and
supports the arguments with the simulation results. The comparative study can be used to find the best
suited MAC protocol for wireless sensor networks in different environments.
Distributed Spatial Modulation based Cooperative Diversity Schemeijwmn
: In this paper, a distributed spatial modulation based cooperative diversity scheme for relay
wireless networks is proposed. Where, the space-time block code is exploited to integrate with distributed
spatial modulation. Therefore, the interested transmission scheme achieves high diversity gain. By using
Monte-Carlo simulation based on computer, we showed that our proposed transmission scheme outperforms
state-of-the-art cooperative relaying schemes in terms bit error rate (BER) performance.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
A new method for controlling and maintainingIJCNCJournal
Topology Control is an essential technique in a wireless sensor network to extend the operational time of
the sensor nodes. The goal of this technique is to maintain network connectivity and optimize performance
metrics such as network lifetime and throughput. In this paper we presented a new method for controlling
and maintaining topology in wireless sensor networks that show some improvement over the state of art
methods. The results are analyzed based on objective criteria.
Ijaems apr-2016-22TDMA- MAC Protocol based Energy- Potency for Periodic Sensi...INFOGAIN PUBLICATION
Energy potency could be a major demand in wireless sensing element networks. Media Access management is one in every of the key areas wherever energy potency is achieved by planning such MAC protocol that's tuned to the necessities of the sensing element networks. Applications have different necessities and one MAC protocol can't be best TDMA-based MAC (TDMAC) protocol that is specially designed for such applications that need periodic sensing of the sensing element field. TDMAC organizes nodes into clusters. Nodes send their knowledge to their cluster head (CH) and CHs forward it to the bottom station. CHs removed from the bottom station use multi-hop communication by forwarding their knowledge to CHs nearer than themselves to the bottom station each put down-cluster and intra-cluster communication is only TDMA-based that effectively eliminates each inter cluster further as intra-cluster interference.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
Computational Investigation of Asymmetric Coplanar Waveguides Using Neural Ne...Konstantinos Karamichalis
In order to compute the characteristic impedance and the relative effective dielectric constant of an
asymmetric coplanar waveguide with infinite or finite dielectric thickness, the use of artificial neural networks
is valuable. The method of neural computing presented in this paper uses only one neural model for both
parameters, for this specific waveguide type. The BFGS quasi-Newton back-propagation algorithm was used to
train the developed neural network. Numerical results are given for several configurations along with
comparisons with previously published data.
Throughput analysis of non-orthogonal multiple access and orthogonal multipl...IJECEIAES
This study introduces the non-orthogonal multiple access (NOMA) technique into the wireless energy harvesting K-hop relay network to increase throughput. The relays have no dedicated energy source and thus depend on energy harvested by wireless from a power beacon (PB). Recently, NOMA has been promoted as a technology with the potential to enhance connectivity, reduce latency, increase fairness amongst users, and raise spectral effectiveness compared to orthogonal multiple access (OMA) technology. For performance considerations, we derive exact throughput expressions for NOMA and OMA-assisted multi-hop relaying and compare the performance between the two. The obtained results are validated via Monte Carlo simulations.
Optimizing the Performance of I-mod Leach-PD Protocol in Wireless Sensor Netw...ijsrd.com
Wireless Sensor Networks (WSNs) is a networks of thousands of inexpensive miniature devices capable of computation, communication and sensing. WSN is being been attracting increasing interest for supporting a new generation of ubiquitous computing systems with great potential for many applications such as surveillance, environmental monitoring, health care monitoring or home automation. In the near future, wireless sensor network is expected to consists of thousand of inexpensive nodes, each having sensing capability with limited computational and communication power which enables to deploy large scale sensor networks. Large scale WSN is usually implemented as a cluster network. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, saves energy and thus prolongs network lifetime. LEACH (Low Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, how to adjust threshold based on the residual energy, and the measurement of energy required for transmission, based on the distance of cluster head from the base station, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of residual energy and required energy, and the time length of each round are deduced, thereby modifying the threshold value calculation. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
In this paper, we consider the joint optimal sensing
and distributed MAC protocol design for cognitive radio
networks. Specifically, we design a synchronized MAC protocol
for dynamic spectrum sharing among multiple secondary
users, which incorporates spectrum sensing for protecting active
primary users. We perform saturation throughput analysis for
the proposed MAC protocol that explicitly captures spectrum
sensing performance. Then, we find its optimal configuration
by formulating a throughput maximization problem subject to
detection probability constraints for primary users. In particular,
the optimal solution of this optimization problem returns the
required sensing time for primary users’ protection and optimal
contention window for maximizing total throughput of the
secondary network. Finally, numerical results are presented to
illustrate a significant performance gain of the optimal sensing
and protocol configuration.
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.
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.
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.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...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.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
How libraries can support authors with open access requirements for UKRI fund...
Ijcnc050207
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
AN ENERGY EFFICIENT ANALYSIS OF S-MAC
AND H-MAC PROTOCOLS FOR WIRELESS
SENSOR NETWORKS
P.T.Kalaivaani1 and A.Rajeswari2
1
Department of Electronics and Communication Engineering,
MNM Jain Engineering College, Anna University, Chennai, India
ptkalaivaani@gmail.com
2
Department of Electronics and Communication Engineering,
Coimbatore Institute of Technology, Coimbatore, India
Rajeswari.ece.cit@gmail.com
ABSTRACT
Wireless Sensor Networks (WSNs) is an interesting topic to the researchers because of its various
applications. The applications are health monitoring and environmental monitoring, Industrial Process
Monitoring, Target detection, Target tracking, Energy Efficiency, Disaster Management and Military
Security Systems. The wireless medium requires highly optimized medium Access Protocols to avoid
interferences. Limited resources have driven the research towards energy consumption of MAC
functionalities. Two Medium Access Control (MAC) protocol performances are analyzed by using the MAC
layer frame work for wireless sensor networks. In this paper an energy efficient analysis of S-MAC and H-
MAC protocols for wireless sensor networks is proposed with spatial correlation concept. Two MAC
protocols such as Sensor MAC (S-MAC) and Hybrid MAC (H-MAC) protocols are proposed to analyze the
performance of Wireless Sensor Network using four different Parameters such as End to End delay, Packet
Delivery Ratio, Packet Drop Rate and Energy Consumption. Performance analysis is carried out by using
the simulation tool NS2.
KEYWORDS
Medium Access Control (MAC), Wireless Sensor Networks (WSNs), Sensor MAC (S-MAC), Hybrid MAC
(H-MAC),
1. INTRODUCTION
Today the major difficulty in the deployment phase of wireless Sensor Networks is their
dependence on limited battery power. The major role of Medium Access control Protocols is to
coordinate access to and transmission over a medium that is common to other nodes in Wireless
Sensor Networks. The number of nodes in the entire Wireless Sensor Networks design as well as
the number of neighboring nodes in WSNs play a vital part in WSN MAC design. The MAC
plays a central Part in the WSN design because it controls the active and sleeping state of each
node. The prevalent source of energy waste in WSNs are Idle Listening and Over hearing and
transmission, Collisions, Over emitting. The properties that must be considered to design a good
MAC protocols are categorized into two types. They are primary and secondary attributes.
Primary attributes are energy efficiency and scalability and adaptability to changes such as node
density, network size and topology. Latency, throughput and bandwidth utilization are the
secondary attributes. Basically MAC layer Controls the transmission and reception of the actual
DOI : 10.5121/ijcnc.2013.5207 83
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
packets between the nodes in the Network. It also controls the network interface between a host
when the connection is established or the transaction is performed in a network. In this paper an
Energy Efficient analysis of S-MAC and HMAC protocols for Wireless Sensor Networks is
discussed.
Related work is briefly discussed in section II. In section III,IV,V,VI, The Network model and
the concept of Sensor MAC, Hybrid MAC protocols, Spatial Correlation in WSNs are explained.
In section VII, the results are discussed. In section VIII, conclusion and future work are given.
2. RELATED WORK
A brief Literature survey has been given in the following section
ERMAC is a hybrid MAC Protocol, it is developed from TDMA and CSMA approaches.
ERMAC allows the node to join or leave the network [1].The survey and analysis of most energy
efficient MAC protocol are given with comparison [2]. Demonstration of wireless sensor network
with SMAC protocol is given. A modification in that protocol proves that some nodes to stay
awake longer than the other nodes. The modified protocol improves the energy efficiency and
increases the life time of wireless sensor networks [3] .The outline of Wireless Sensor Network
and MAC, routing protocol is proposed and its analyzed using MATLAB [4]. Properties of
sensor networks that are complex for the design of MAC layer protocol is explained. Several
MAC protocols has been listed out with their with their strength and weakness[5].Efficient
Hybrid MAC with an embedded cross layer optimization solution with an embedded cross layer
optimization technique has been given. HMAC combines energy efficient feature of contention
based and TDMA based MAC protocols that adapts a short frame structure for packet delivery
[7]. Aiming to highlight the energy waste sources in Wireless Sensor Networks. SMAC and
Timeout MAC and TEEM are the three different MAC protocols that are investigated in this
paper [9].Simulation study of performance of several conventional and hybrid MAC protocol has
been proposed. For the specific network conditions, the relative performance of each protocol has
been analyzed [10].
3. NETWORK MODEL
An architecture of WSNs consists of radio and command center. Sensors have small batteries and
they are deployed in unattended setup. Therefore replacing sensor’s battery is not practical. So the
energy efficient design and management of sensor network are real challenges for the researchers.
The hardware elements of a WSNs are shown in Figure1.
Figure 1. Hardware Elements of a Wireless sensor Networks
84
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
Memory, Communication element, Embedded Processor, sensors and Power Supply form the
hardware elements of a wireless sensor network.
V1 V2 V3 V4 V5 Vn-1 Vn
…..
Figure 2. Wireless Sensor Network Model
The total number of nodes available in sensor field is v1 to vn. Each has their own residual energy.
The protocol stack and the cross layer information exchange of the sensor nodes are given in
Figure 3 and 4.
Figure 3. Protocol Stack Figure 4. Cross layer information exchange
The protocol stack is shown in Figure 3. It consists of application Layer, Transport layer,
Network layer, Data link layer and Physical layer. In Figure 4, the cross layer information
exchange has been given. It consists of five layers which are available in protocol stack and all
the layers are connected to cross layer information exchange. Two MAC protocols are proposed
in this work. They are S-MAC and HMAC. The protocols are discussed in the following section.
4. SENSOR MAC
S-MAC is a contention based protocol proposed for energy constrained in a network. S-MAC
protocol provides mechanism to get around idle listening, collisions and over hearing. It adopts a
periodic wakeup scheme, i.e., each node alternates between a fixed length listen period and fixed
length sleep period. S-MAC includes periodic listen and sleep and collision and over hearing
avoidance and message passing. The energy waste caused by idle listening is reduced by sleep
schedule in S-MAC. In S-MAC, nodes form virtual clusters with common sleep schedule, so all
the clusters wake up and start communicating at the same time. The channel is divided into an
active and sleep period. Potential energy saving is determined by the ratio between the active and
passive periods during the active period. The node starts synchronization sequence is called
synchronizer. It emits an SYNC packet which synchronizes all nodes inside the virtual cluster.
Collision avoidance is achieved by the carrier sense and by the data exchange schemes
RTS/CTS/DATA/ACK [6].The active and sleep period as of S-MAC protocols are shown in
Figure 5 for three different number of nodes.
The entire latency over N hopes are given by the formula,
85
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
∑ (t
N
L(N)= s ,n + td )
(1)
k =0
N is the number of hops, ts,n+td backoff and transmission delay , n represents the current hop value
Average Latency over N hop is given by, E[L(N)]=N t s , n + t d ) ( (2)
Dn = tsl,n+ts,n+td (3)
Where T >> td and tsl,n is the sleep delay. In S-MAC without adaptive listening contention only
starts at the beginning of each frame. This is given by
T = ts,n-1 + td+ tsl,n (4)
So the sleep delay at hop n is given by
tsl,n = T – (ts,n-1 + td) (5)
Substituting the equation (5) in (3)
Dn = T + ts,n – ts,n-1 (6)
A packet can be generated on the source at any time within a frame, so the sleep delay on
the first hop tsl,1, is a random variable whose value lies in (0,T).suppose tsl,1 is uniformly
distributed in (0,T).It means value is T/2.Combining it with equation (6), the overall delay of a
packet over N hop is given by,
N
D(N) = D1+ ∑D
n=2
n
(7)
∑ (T + t − t s ,n −1 )
N
= tsl,1+ts,1+td+ s ,n
n=2
= tsl,1 + (N-1)T + ts,N+td
The average latency of S-MAC without adaptive listen over N hops is given by
E[D(N)]=E[tsl,1+(N-1)T+Ts,N+td]
(8)
=T/2+(N-1)T+Ts+td
=NT-T/2+ts+td
From the equation (8) we can observe that the multihop latency increases with the number of
hops in SMAC when each node strictly follows its sleep schedule.
86
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
Figure 5. S-MAC Protocol
5. HYBRID MAC PROTOCOL (HMAC)
To overcome the short comings of Carrier Sense Multiple Access (CSMA) and Time division
Multiple Access (TDMA), HMAC improves channel utilization and latency under different
network conditions such as node density, scalability and traffic in the network . HMAC
introduces the concept of slotted frame structure in which the slot for individual frame structures
is dynamically shared. A slotted frame structure helps to improve energy efficiency. In HMAC,
slotted frame structure needs time synchronization with in each node two hop neighbour. HMAC
also supports one hop broadcast mechanism. HMAC Frame Structure is given in Figure 6.
Figure 6. HMAC Frame Structure
HMAC is similar to SMAC with only one difference of slotted sleep time
In HMAC, time frame Tx is given by
Tx=tactive+Ctsl,n (9)
Where C is the number of equal length slot and tactive is the listen time same as S-MAC.
During the tactive time HMAC can reserve the slots for nr hops within the same T, so the delay for
one hop transmission over nr , hops is given by
D1 = T/nr (10)
Average latency of HMAC is given by,
87
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
N
E [D(N)]≈E[ ∑D
n =1
1 ] (11)
≈ N(T/ nr)=[N(T/ nr)]
MAC is an important technique. It tries to improve the energy efficiency also avoid collisions and
retransmission. MAC protocol is used to provide the high throughput and QOS .SMAC improves
the energy efficiency by dividing the time into large frames. Each frame has an active part and
sleep part. Using the two different parts SMAC saves unnecessary waste of energy efficiency.
However, HMAC protocol not only reduces the comparable amount of energy but also provides
better QOS.
6. SPATIAL CORRELATION IN WIRELESS SENSOR NETWORKS
WSN are event based systems that rely on the collective report of several small sensor nodes
observing a physical phenomenon. Applications related to WSN require spatially dense sensor
deployment to achieve coverage. Several sensor nodes record information about a single event in
a sensor field. Due to elevated density in the topology of WSN, the record created by the sensor
nodes may be spatially correlated and subject to an event. The degree of spatial correlation
increases with decreasing internode separation.
To develop the spatial correlation in WSN can lead to significant performance improvement of
communication protocols. Spatially separated sensor nodes is more useful than the highly
correlated data from closely located sensor nodes to the sink. A smaller number of sensor data
might be adequate to transmit certain event features to the sink with in a distortion constraint
Each sensor node in the sensor field observes the noisy version of a physical phenomenon. The
sink is interested in observing the physical phenomenon using the observations from sensor nodes
with the highest accuracy. The physical phenomenon is modeled as a spatio-temporal process (t; x
; y) as a function of time t and spatial coordinates (x;y).
Depending on the special application, the physical phenomenon may be a spatio-temporal process
generated by a point source .The sink is reconstructing the source signal at a specific location
based on sensor observations. Although the reconstruction of signal is application specific, the
properties of the observations can be modeled based on the spatio temporal process.
Generally the covariance model can be classified into four types .they are
1. Spherical Model
2. Power Exponential Model
3. Rational Quadratic Model
4. Matern Model
Proposed work considers Power exponential model and the covariance function is given by the
equation (12),
PE ( − d /1) 2
Kv (d ) = e ; 1 > 0, 2 ∈ (0, 2] (12)
In Equation (12), Kv represents covariance function and PE represents power exponential model.
For 2 = 1 , the model becomes exponential, while for 2 = 2 the model becomes squared
88
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
exponential. The parameter θ1 is important because it controls the relationship between the
distance di,j and ρi,j.
Correlation Region
Figure.7 Representation of Correlation Region
Figure.7 shows the representation of correlation region.
corr { Si,,Sj } = ρi,j = Kv(di,j) = E [Si,Sj ]
(13)
σ²s
Equation (13) gives the correlation between the two nodes ni and nj located at the coordinates Si,
Sj .where di,j = ρsi – ρsj . where ρ denotes the distance between nodes ni and nj respectively, and
kv (⋅) is the correlation model or covariance model. The covariance function is assumed to be
non-negative and decreases monotonically with the distance.
Spatial Correlation between the sensor nodes helps to prevent redundant data during transmission.
In wireless sensor network, when an event occurs in a sensor field, the nodes which are very
nearer to that event area detect the event information and it is sensed by the neighborhood nodes.
Every node transmits its own data to sink which is highly correlated that results in redundant
transmission. It is not requisite for all the nodes in the sensor field to send the data to the sink.
Redundant transmission in a network is reduced by decreasing the selecting the subset of sensor
nodes. The subset nodes efficiently transmit the data to sink. The filtration of redundant data and
the maximization of network lifetime are increased by designing the efficient MAC protocol. The
spatial correlation region is defined as the region in which all the sensor nodes send the readings
which are similar in nature and therefore it is enough to send a single report to represent the
correlation region.
Total number of nodes available in an event area is N, where the event source is S. Each node in
the sensor field observes the noisy version of event information Xi(n), Si(n) is spatially correlated
to event source S. Each node has to encode its observation for the purpose of reporting an event
information to sink node. Sink is available at the other end which is responsible for decoding the
ˆ
information to get an estimated value of S . At a time n, each observed sample is denoted as Xi(n),
equation is formed as,
X i [ n ] = Si [ n ] + N i [ n ] (14)
where the symbol i denotes the spatial location of the node ni , i.e. (xi,yi), Si(n) is the realization of
the space-time process s(t,x,y) at time t= tn and (x,y)=( xi,yi) and Ni(n) is the observation noise [1]
. {Ni(n)} is a sequence of i.i.d Gaussian random variables of zero mean and variance N . We 2
89
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
assume that the noise each sensor node encounters is independent of each other, i.e., Ni(n)and
Nj(n) are independent .Each observation Xi (n) is then encoded into Yi(n) by the source-coding at
the sensor node as,
Yi [ n ] = fi ( X i [ n ]) (15)
The information is transferred to the sink through the network. The sink on the other hand
ˆ
decodes the received data to reconstruct an estimation S of the source S.
S = g ( Y [ n ], ..., Y [ ]; ...; N [ n1], ..., N [ ])
ˆ
1 1 1 n Y Y n (16)
Based on the data received from N nodes in the event area over a time period τ, the time
difference between tn1 and tnτ is expressed as,
= tn − tn (17)
1
The selection of locations of correlated points based on a distortion constraint has been analyzed
by means of Vector Quantization (VQ) algorithm. Code book and partition are initially identified
by VQ algorithm. Based on the values of code book and partition the distortion value is reduced .
The code book represents the locations of the representative node and partition represents the
areas of which representative nodes are responsible. Significant improvement is achieved in
distortion by selecting the location of representative node using VQ algorithm. The spatial
correlation region is defined as the region in which all the sensor nodes send the readings which
are similar in nature and therefore it is enough to send a single report to represent the correlation
region. Correlation Radius and Correlation Region are two important observations in spatial
correlation based iterative node selection algorithm.
• Correlation Radius – It is represented by rcorr.
It is the radius of correlation region
• Correlation Neighbor – A node nj is said to be the correlation neighbor of
node ni if the distance di,j of the node ni is smaller than
rcorr
Spatial correlation based S-MAC is compared with spatial correlation based H-MAC in the
proposed work. The parameters considered for the analysis are end to end delay, Packet delivery
ratio, Throughput, Energy consumption. The performance analysis is given in Section 7.
7. RESULTS AND DISCUSSIONS
An Energy Efficient Analysis of S-MAC And HMAC Protocols For Wireless Sensor Networks
is proposed and implemented using the simulation tool NS2.The Parameters such as End to End
delay, Packet delivery ratio, Throughput and Energy Consumption have been compared with S-
MAC and H-MAC protocols. The network size is considered as 1500x1500 and totally eight
number of hops are involved. 2 MHz of bandwidth and 1000 joules of initial energy with 1Mbps
range of data rate and 1mW of transmitting and receiving and Idle power values with 0.01 mw of
sleep power are designed to form a network model. In the following sections, the comparison of
End to End delay, Packet delivery ratio, Throughput, Energy Consumption with S-MAC and
HMAC protocol is discussed briefly.
90
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
7.1. Comparison of End to End delay with S-MAC and HMAC
End to End delay is defined as the ratio between a sum of individual data packet delay to the total
number of data packets delivered.
End to End delay = [(Sum of Individual data packet delay) / (Total number of data
Packets delivered)]
Figure 8. End to End delay Vs Per hop
Figure 9. End to End delay Vs Packet Arrival interval
7.2 Comparison of Packet Delivery Ratio with S-MAC and HMAC
Packet Delivery ratio is the percentage of the ratio between total number of data packets
successfully delivered to the total number of data packets sent.
Pdr = [(Total number of data packets successfully delivered) / (Total number of data packets sent
)] * 100%
91
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
Figure 10. Packet Delivery Ratio
7.3 Comparison of Throughput with S-MAC and H-MAC
Throughput is defined as the number of packets delivered at sink node per time unit
Figure 11. Throughput
7.4 Comparison of Energy Consumption with S-MAC and H-MAC
Energy Consumption is defined as the ratio between sum of energy expended by each node to the
total number of data packets delivered.
Energy Consumption = [(Sum of Energy expended by each node) / (Total number of data
packets delivered)]
92
11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
Figure 12. Energy Consumption
As shown Figure 8&9 , the End to End delay value for S-MAC will be higher than compared with
the H-MAC for each packet arrival interval and for each hop. As shown in Figure 10, the Packet
delivery ratio for H-MAC is very high, at 20 PAI, the Packet delivery ratio is 12% higher than
that of S-MAC. As shown in Figure 11, the H-MAC protocol gives 8% higher value of Energy
Consumption & 9% higher value of throughput than S-MAC protocol. As shown in Figure 12, H-
MAC protocol gives 50% higher energy consumption than that of S-MAC. As shown in Figures
8,9,10,11,12 the performance of H-MAC is higher than that of S-MAC protocol because H-MAC
has the best time synchronization and full duplex communication. It has the ability to change
according to the environment. Therefore it is suitable for broadcast and convergecast.
8. CONCLUSION AND FUTURE WORK
An Energy Efficient Analysis of S-MAC and H-MAC Protocols for Wireless Sensor Networks
is proposed in this paper. The concept of S-MAC and the concept of H-MAC protocols are
analyzed individually using spatial correlation with the simulation tool NS2.The parameters
considered for this analysis are End to End delay, Packet delivery ratio, Throughput and Energy
Consumption. For various set of values the performance of S-MAC and H-MAC is analyzed. The
results show that H-MAC protocol performance is better than that of S-MAC protocol. In future,
different types of MAC protocol performance will be analyzed and the values of energy
consumption for each node will be tabulated.
REFERENCES
[1] Lanny Sitanayah,Cormac J.Sreenan,Kenneth N.Brown,“A Hybrid MAC Protocol for Emergency
Response Wireless Sensor Networks”, SENSORCOMM 2010, 2010,pp-244- 249.
[2] Lamia Chaari, Lotif “Wireless Sensors Networks MAC protocols analysis” Journal of
Telecommunications,Vol 2, No 1,April 2010.
[3] Somnath Ghosh,Prakasj Veeraraghavan,Samar Singh,Lei Zhang “Performance of a Wireless
sensor Network MAC Protocol with a Global Sleep Schedule” International journal of Multimedia
and Ubiquities Engineering, Vol 4,No 2,April 2009.
[4] Nidhi Batra,Anuj j jain,susurender Dhiman “An Optimized Energy Efficient Routing Algorithm
for WSN” Innovative Journal of Innovative Technology and Creative Engg,Vol.1,No.5 May 2011.
[5] Ilker Demirkol, Cem Ersoy and Fathih ala,“MAC Protocols for Wireless Sensor Networks: A
survey”,IEEE Communication Magazine,Vol 44,No.4,2006,pp.115-
121.http:dx.doi.org/10.1109/MCOM.2006.1632658.
93
12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.2, March 2013
[6] Uros Pesovic, Aleksandar Peulic,Zarko Cucej “MAC Protocols for Wireless Sensor
Network”,Electro Technical Review,2008,pp. 50-55.
[7] Heping Wang, Xiaobo Zhang,Farid Nait-Abdesesselam, “Cross Layer Optimized MAC to support
Multihop QOS routing for Wireless Sensor Network”, IEEE Transactions on Vehicular
Technology, 2010,vol. 59, No.5, http://dx.doi.org/10.1109/TVT.2010.2042185.
[8] Ines Slama,Badii Jouber,Djamal Zeghlache “Priority based Hybrid MAC for Energy Efficiency
in Wireless Sensor Networks”,Wireless Sensor Networks,2010,Vol.2,pp-755-767.
[9] M.Miladi,T.Ezzedine,R.Bouallegue, “Hybrid MAC Protocols Characteristics in Multi-hops Wireless
Sensor Networks”, International journal of Electrical and Computer Engineering,Vol.3,No.3,
2008.
[10] Chalmtac A.farag, A.D.Myers,V.R.Syrotiuk,G.Zkruba, “A Performance Comparison of Hybrid and
Conventional MAC Protocols for Wireless Networks”, Vehicular Technology Conference
Proceedings VTC 2000, vol.1,pp.201-205.
94