Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that open the door of pleasing plenty of researchers during this field of study. In several under water based sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility of each sensor nodes are measured through the water atmosphere from the water flow for sensor based protocol formations. Researchers have developed many routing protocols. However, those lost their charm with the time. This can be the demand of the age to supply associate degree upon energy-efficient and ascendable strong routing protocol for under water actuator networks. During this work, the authors tend to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use of total energy consumption and ensures packet transmission which redirects as an additional reliability in compare to different routing protocols. In this work, the authors have used the level of forwarding node, residual energy and distance from the forwarding node to the causing node as a proof in multicasting technique comparisons. Throughout this work, the authors have got a recognition result concerning about 86.35% on the average in node multicasting performances. Simulation has been experienced each in a wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned protocol.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Grid Based Priority Routing Protocol for UWSNsIJCNCJournal
In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver
data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected sensor nodes called cell-heads. The unique feature in GBPR is the lassification of the neighboring cells in
different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is
evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average delay and packet delivery ratio.
GPS-less Localization Protocol for Underwater Acoustic NetworksCSCJournals
The problem of underwater positioning is increasingly crucial due to the emerging importance of sub-sea activities. Knowledge of node location is essential for many applications for which sensor networks can be used. At the surface, positioning problems have been resolved by the extended use of GPS, which is straightforward and effective. Unfortunately, using GPS in the sub-sea environment is impossible and positioning requires the use of special systems. One of the major challenges in the underwater acoustic networks (UANs) area of research is the development of a networking protocol that can cope with the management of a dynamic sub-sea network. We propose a scheme to perform node discovery, using only one seed node (primary seed) in a known position. The discovery protocol can be divided into two parts: First, building up the relative co-ordinate system. Second, involving more remote nodes becoming seed nodes for further discoveries. Four different algorithms have been investigated; (i) Farthest/Farthest Algorithm, (ii) Farthest/Nearest Algorithm, (iii) Nearest/Farthest Algorithm and (iv) Nearest/Nearest Algorithm. We investigated the performances of random and fixed (grid) network topologies. Different locations of primary seed node were exercised and statistics for node discovery will be reported.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that open the door of pleasing plenty of researchers during this field of study. In several under water based sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility of each sensor nodes are measured through the water atmosphere from the water flow for sensor based protocol formations. Researchers have developed many routing protocols. However, those lost their charm with the time. This can be the demand of the age to supply associate degree upon energy-efficient and ascendable strong routing protocol for under water actuator networks. During this work, the authors tend to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use of total energy consumption and ensures packet transmission which redirects as an additional reliability in compare to different routing protocols. In this work, the authors have used the level of forwarding node, residual energy and distance from the forwarding node to the causing node as a proof in multicasting technique comparisons. Throughout this work, the authors have got a recognition result concerning about 86.35% on the average in node multicasting performances. Simulation has been experienced each in a wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned protocol.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Grid Based Priority Routing Protocol for UWSNsIJCNCJournal
In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver
data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected sensor nodes called cell-heads. The unique feature in GBPR is the lassification of the neighboring cells in
different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is
evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average delay and packet delivery ratio.
GPS-less Localization Protocol for Underwater Acoustic NetworksCSCJournals
The problem of underwater positioning is increasingly crucial due to the emerging importance of sub-sea activities. Knowledge of node location is essential for many applications for which sensor networks can be used. At the surface, positioning problems have been resolved by the extended use of GPS, which is straightforward and effective. Unfortunately, using GPS in the sub-sea environment is impossible and positioning requires the use of special systems. One of the major challenges in the underwater acoustic networks (UANs) area of research is the development of a networking protocol that can cope with the management of a dynamic sub-sea network. We propose a scheme to perform node discovery, using only one seed node (primary seed) in a known position. The discovery protocol can be divided into two parts: First, building up the relative co-ordinate system. Second, involving more remote nodes becoming seed nodes for further discoveries. Four different algorithms have been investigated; (i) Farthest/Farthest Algorithm, (ii) Farthest/Nearest Algorithm, (iii) Nearest/Farthest Algorithm and (iv) Nearest/Nearest Algorithm. We investigated the performances of random and fixed (grid) network topologies. Different locations of primary seed node were exercised and statistics for node discovery will be reported.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
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.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
SIMULATING CORTICAL MAPS FOR ATTENTION SHIFT IN AUTISMIJCNCJournal
Autism is a pervasive neuro-developmental disorder, primarily encompassing difficulties in the social,
language, and communicative domains. Because autism is a spectrum disorder, it affects each individual
differently and has varying degrees. There are three core aspects of impairment based upon the Diagnostic
and Statistical Manual of Mental Disorders (DSM-IV), namely impairment in socialization, impairment in
communication, and restricted repetitive activities or interests. This work describes the experiment aims at
expressing autistic traits through the use of self-organizing map. Works related to simulating autism
through self-organizing map is limited. This work compare and contrast the difference in attention index
for normal learning and marred attention shift learning ability. It was found that the attention index of
normal learning is 9 times better marred attention shift for both random and pre-fixed input data. In the
marred attention shift context, neurons adapt more towards the mean of both sources combined under
marred context while some neurons adapt towards mean of one source under normal context. The normal
learning ability produces maps with neurons orienting towards mean values of combined stimuli source.
Impairment in learning ability produces similar cortical maps compared to normal learning ability. The
major difference is in the attention index.
GAME THEORY BASED INTERFERENCE CONTROL AND POWER CONTROL FOR D2D COMMUNICATIO...IJCNCJournal
With the current development of mobile communication services, people need personal communication of
high speed, excellent service, high quality and low latency,however, limited spectrum resources become
the most important factor to hamper improvement of cellular systems. As big amount of data traffic will
cause greater local consumption of spectrum resources, future networks are required to have appropriate
techniques to better support such forms of communication. D2D (Device-to-device) communication
technology in a cellular network makes full use of spectrum resources underlaying, reduces the load of the
base station, minimizes transmit power of the terminals and the base stations, thereby enhances the overall
throughput of the networks. Due to the use of multiplexing D2D UE (User equipment) resources and
spectrum, and the interference caused by the sharing of resources between adjacent cells, it has become a
major factor affecting coexisting of cellular subscribers and D2D users. When D2D communication
multiplexes the uplink resources, the base-stations are easily to be disturbed; when the downlink resources
are multiplexed, the users of downlink are susceptible to interference. In order to build a high-efficient
mobile network, we can meet the QoS requirements by controlling the power to suppress the interference
between the base station and a terminal user.
Efficient management of bandwidth in wireless networks is a critical factor for a successful communication system. Special features of wireless networks such user mobility and growth of wireless applications and their high bandwidth intensity create a major challenge to utilize bandwidth resources optimally. In this research, we propose a model for an adaptable network bandwidth management method that combines bandwidth reservation and bandwidth adaptation to reduce call blocking and dropping probabilities. The model is an integer program that determines whether or not to accept new calls and decides how to allocate bandwidth optimally in a way to maximize user satisfaction. The results of a simulation study show that the proposed method outperforms an existing method with respect to key performance measures such as call blocking and dropping probabilities and call time survivability. This survivability indicator is a new measure that is introduced for the first time in this paper. We also present a second tradeoff model to allow the network manager to control call dropping probability. The results of a second simulation study show that network users are better off if a zero call dropping policy is adopted as proposed in the first model.
SIMPLIFIED CBA CONCEPT AND EXPRESS CHOICE METHOD FOR INTEGRATED NETWORK MANAG...IJCNCJournal
The process of choosing and integrating a network management system (NMS) to an existing computer
network became a big question due to the complexity of used technologies and the variety of NMS options.
Most of computer networks are being developed according to their internal rules in cloud environments.
The use of NMS requires not only infrastructural changes, consequently increasing the cost of integration
and maintenance, but also increases the risk of potential failures. In this paper, conception and method of
express choice to implement and integrate a network management system are presented. Review of basic
methods of cost analysis for IT systems is presented. The simplified conception of cost benefits analysis
(CBA) is utilized as a basis of the offered method. A final estimation is based on three groups of
parameters: parameters of expected integration risk evaluation, expected effect and level of completed
management tasks. The explanation of the method is provided via example.
OMT: A DYNAMIC AUTHENTICATED DATA STRUCTURE FOR SECURITY KERNELSIJCNCJournal
We introduce a family of authenticated data structures — Ordered Merkle Trees (OMT) — and illustrate
their utility in security kernels for a wide variety of sub-systems. Specifically, the utility of two types of
OMTs: a) the index ordered merkle tree (IOMT) and b) the range ordered merkle tree (ROMT), are
investigated for their suitability in security kernels for various sub-systems of Border Gateway Protocol
(BGP), the Internet’s inter-autonomous system routing infrastructure. We outline simple generic security
kernel functions to maintain OMTs, and sub-system specific security kernel functionality for BGP subsystems
(like registries, autonomous system owners, and BGP speakers/routers), that take advantage of
OMTs.
ADAPTIVE MULTI-TENANCY POLICY FOR ENHANCING SERVICE LEVEL AGREEMENT THROUGH R...IJCNCJournal
The appearance of infinite computing resources that available on demand and fast enough to adapt with
load surges makes Cloud computing favourable service infrastructure in IT market. Core feature in Cloud
service infrastructures is Service Level Agreement (SLA) that led seamless service at high quality of service
to client. One of the challenges in Cloud is providing heterogeneous computing services for the clients.
With the increasing number of clients/tenants in the Cloud, unsatisfied agreement is becoming a critical
factor. In this paper, we present an adaptive resource allocation policy which attempts to improve
accountable in Cloud SLA while aiming for enhancing system performance. Specifically, our allocation
incorporates dynamic matching SLA rules to deal with diverse processing requirements from
tenants.Explicitly, it reduces processing overheadswhile achieving better service agreement. Simulation
experiments proved the efficacy of our allocation policy in order to satisfy the tenants; and helps improve
reliable computing.
Mobile paymentmethodbased on public keyIJCNCJournal
Mobile payment is defined as mobile money, which is considered as an attractive alternative for cash,
cheque, or credit. In this paper we propose a new secure mobile paymentmethod. This method is
summarized in three processes: firstly, the authentication process, which involves the authentication phases
for the applied customers. Secondly, the member recognition process which tests and ensures the customer
membership by the market server. Finally, payment processwhich will be done by ciphering the customer
information using public-key encryption cryptosystem (RSA), to be submitted over an insecure network to
the market server. Actually, this mobile payment methodis more efficient than otherpayment methods since
the customer can pay from his/her own mobilephone without any extra cost and effort. The RSA public-key
encryption system ensures the security of the proposed method. However, to prevent a brute force attack,
the choice of the key size becomes crucial.
LIGHT FIDELITY (LI-FI) BASED INDOOR COMMUNICATION SYSTEMIJCNCJournal
Indoor wireless communication is an essential part of next generation wireless communication system.For
an indoor communication number of users and their device are increasing very rapidly so as a result
capacity of frequency spectrum to accommodate further users in future is limited and also it would be
difficult for service providers to provide more user reliable and high speed communication so this short
come can be solve in future by using Li-Fi based indoor communication system. Li-Fi which is an emerging
branch of optical wireless communication can be useful in future as a replacement and backup of Wireless
Fidelity (Wi-Fi)for indoor communication because it can provide high data rate of transmission along with
high capacity to utilize more users as its spectrum bandwidth is much broader than the radio spectrum. In
this paper we will look at the different aspects of the Li-Fi based indoor communication system,summarizes
some of the research conducted so far andwe will also proposed a Li-Fi based communication model
keeping in mind coverage area for multiple user and evaluate its performance under different scenarios .
A proposal to enhance cellular and wifiIJCNCJournal
WiFi offloading is becoming one of the key enablers to help the network operators dealing with the exponentially growing demand of mobile data. The idea of using WiFi to offload data traffic from cellular network has proposed for many years. However, the interoperability issue between the two networks needs to be enhanced so that WiFi can efficiently supplement for the cellular network in case of congestion or outage. In this paper, we propose a novel network roaming and selection scheme based on 3GPP TS 24.312 and IEEE 802.11k, u standards to enhance cellular and WiFi interworking. The proposed scheme is aimed at enhancing the network roaming and selection so that WiFi network can serve as a supplement and backup access network for the cellular not only for congestion control but also in case of unexpected network failure event. We also model and evaluate the proposed scheme in a typical HetNet with interworking WiFi access points and cellular base stations. The simulation result shows that our proposed scheme quickly detects unexpected network failure event and assists active UEs to perform handoff to preferable alternative point of access. As a result, service disruption is substantially reduced and quality of experience (downlink/uplink’s throughput) is improved. Therefore, our proposed scheme can be used for a more reliable HetNet in terms of congestion control and disruption tolerance.
Minimum Physical Hop (MPH) has been proposed as a peer selection algorithm for decreasing inter-AS (Autonomous System) traffic volume in P2P live streaming. In MPH, a newly joining peer selects a peer whose physical hop count (i.e., the number of ASes traversed on the content delivery path) from it is the minimum as its providing peer. However, MPH shows high inter-AS traffic volume when the number of joining peers is large. In this paper, we propose IMPH that tries to further decrease the inter-AS traffic volume by distributing peers with one logical hop count (i.e., the number of peers or origin streaming servers (OSSes) traversed on the content delivery path from an OSS to the peer) to many ASes and encouraging the following peers to find their providing peers within the same AS. Numerical examples show that IMPH achieves at the maximum of 64% lower inter-AS traffic volume than MPH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
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.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
SIMULATING CORTICAL MAPS FOR ATTENTION SHIFT IN AUTISMIJCNCJournal
Autism is a pervasive neuro-developmental disorder, primarily encompassing difficulties in the social,
language, and communicative domains. Because autism is a spectrum disorder, it affects each individual
differently and has varying degrees. There are three core aspects of impairment based upon the Diagnostic
and Statistical Manual of Mental Disorders (DSM-IV), namely impairment in socialization, impairment in
communication, and restricted repetitive activities or interests. This work describes the experiment aims at
expressing autistic traits through the use of self-organizing map. Works related to simulating autism
through self-organizing map is limited. This work compare and contrast the difference in attention index
for normal learning and marred attention shift learning ability. It was found that the attention index of
normal learning is 9 times better marred attention shift for both random and pre-fixed input data. In the
marred attention shift context, neurons adapt more towards the mean of both sources combined under
marred context while some neurons adapt towards mean of one source under normal context. The normal
learning ability produces maps with neurons orienting towards mean values of combined stimuli source.
Impairment in learning ability produces similar cortical maps compared to normal learning ability. The
major difference is in the attention index.
GAME THEORY BASED INTERFERENCE CONTROL AND POWER CONTROL FOR D2D COMMUNICATIO...IJCNCJournal
With the current development of mobile communication services, people need personal communication of
high speed, excellent service, high quality and low latency,however, limited spectrum resources become
the most important factor to hamper improvement of cellular systems. As big amount of data traffic will
cause greater local consumption of spectrum resources, future networks are required to have appropriate
techniques to better support such forms of communication. D2D (Device-to-device) communication
technology in a cellular network makes full use of spectrum resources underlaying, reduces the load of the
base station, minimizes transmit power of the terminals and the base stations, thereby enhances the overall
throughput of the networks. Due to the use of multiplexing D2D UE (User equipment) resources and
spectrum, and the interference caused by the sharing of resources between adjacent cells, it has become a
major factor affecting coexisting of cellular subscribers and D2D users. When D2D communication
multiplexes the uplink resources, the base-stations are easily to be disturbed; when the downlink resources
are multiplexed, the users of downlink are susceptible to interference. In order to build a high-efficient
mobile network, we can meet the QoS requirements by controlling the power to suppress the interference
between the base station and a terminal user.
Efficient management of bandwidth in wireless networks is a critical factor for a successful communication system. Special features of wireless networks such user mobility and growth of wireless applications and their high bandwidth intensity create a major challenge to utilize bandwidth resources optimally. In this research, we propose a model for an adaptable network bandwidth management method that combines bandwidth reservation and bandwidth adaptation to reduce call blocking and dropping probabilities. The model is an integer program that determines whether or not to accept new calls and decides how to allocate bandwidth optimally in a way to maximize user satisfaction. The results of a simulation study show that the proposed method outperforms an existing method with respect to key performance measures such as call blocking and dropping probabilities and call time survivability. This survivability indicator is a new measure that is introduced for the first time in this paper. We also present a second tradeoff model to allow the network manager to control call dropping probability. The results of a second simulation study show that network users are better off if a zero call dropping policy is adopted as proposed in the first model.
SIMPLIFIED CBA CONCEPT AND EXPRESS CHOICE METHOD FOR INTEGRATED NETWORK MANAG...IJCNCJournal
The process of choosing and integrating a network management system (NMS) to an existing computer
network became a big question due to the complexity of used technologies and the variety of NMS options.
Most of computer networks are being developed according to their internal rules in cloud environments.
The use of NMS requires not only infrastructural changes, consequently increasing the cost of integration
and maintenance, but also increases the risk of potential failures. In this paper, conception and method of
express choice to implement and integrate a network management system are presented. Review of basic
methods of cost analysis for IT systems is presented. The simplified conception of cost benefits analysis
(CBA) is utilized as a basis of the offered method. A final estimation is based on three groups of
parameters: parameters of expected integration risk evaluation, expected effect and level of completed
management tasks. The explanation of the method is provided via example.
OMT: A DYNAMIC AUTHENTICATED DATA STRUCTURE FOR SECURITY KERNELSIJCNCJournal
We introduce a family of authenticated data structures — Ordered Merkle Trees (OMT) — and illustrate
their utility in security kernels for a wide variety of sub-systems. Specifically, the utility of two types of
OMTs: a) the index ordered merkle tree (IOMT) and b) the range ordered merkle tree (ROMT), are
investigated for their suitability in security kernels for various sub-systems of Border Gateway Protocol
(BGP), the Internet’s inter-autonomous system routing infrastructure. We outline simple generic security
kernel functions to maintain OMTs, and sub-system specific security kernel functionality for BGP subsystems
(like registries, autonomous system owners, and BGP speakers/routers), that take advantage of
OMTs.
ADAPTIVE MULTI-TENANCY POLICY FOR ENHANCING SERVICE LEVEL AGREEMENT THROUGH R...IJCNCJournal
The appearance of infinite computing resources that available on demand and fast enough to adapt with
load surges makes Cloud computing favourable service infrastructure in IT market. Core feature in Cloud
service infrastructures is Service Level Agreement (SLA) that led seamless service at high quality of service
to client. One of the challenges in Cloud is providing heterogeneous computing services for the clients.
With the increasing number of clients/tenants in the Cloud, unsatisfied agreement is becoming a critical
factor. In this paper, we present an adaptive resource allocation policy which attempts to improve
accountable in Cloud SLA while aiming for enhancing system performance. Specifically, our allocation
incorporates dynamic matching SLA rules to deal with diverse processing requirements from
tenants.Explicitly, it reduces processing overheadswhile achieving better service agreement. Simulation
experiments proved the efficacy of our allocation policy in order to satisfy the tenants; and helps improve
reliable computing.
Mobile paymentmethodbased on public keyIJCNCJournal
Mobile payment is defined as mobile money, which is considered as an attractive alternative for cash,
cheque, or credit. In this paper we propose a new secure mobile paymentmethod. This method is
summarized in three processes: firstly, the authentication process, which involves the authentication phases
for the applied customers. Secondly, the member recognition process which tests and ensures the customer
membership by the market server. Finally, payment processwhich will be done by ciphering the customer
information using public-key encryption cryptosystem (RSA), to be submitted over an insecure network to
the market server. Actually, this mobile payment methodis more efficient than otherpayment methods since
the customer can pay from his/her own mobilephone without any extra cost and effort. The RSA public-key
encryption system ensures the security of the proposed method. However, to prevent a brute force attack,
the choice of the key size becomes crucial.
LIGHT FIDELITY (LI-FI) BASED INDOOR COMMUNICATION SYSTEMIJCNCJournal
Indoor wireless communication is an essential part of next generation wireless communication system.For
an indoor communication number of users and their device are increasing very rapidly so as a result
capacity of frequency spectrum to accommodate further users in future is limited and also it would be
difficult for service providers to provide more user reliable and high speed communication so this short
come can be solve in future by using Li-Fi based indoor communication system. Li-Fi which is an emerging
branch of optical wireless communication can be useful in future as a replacement and backup of Wireless
Fidelity (Wi-Fi)for indoor communication because it can provide high data rate of transmission along with
high capacity to utilize more users as its spectrum bandwidth is much broader than the radio spectrum. In
this paper we will look at the different aspects of the Li-Fi based indoor communication system,summarizes
some of the research conducted so far andwe will also proposed a Li-Fi based communication model
keeping in mind coverage area for multiple user and evaluate its performance under different scenarios .
A proposal to enhance cellular and wifiIJCNCJournal
WiFi offloading is becoming one of the key enablers to help the network operators dealing with the exponentially growing demand of mobile data. The idea of using WiFi to offload data traffic from cellular network has proposed for many years. However, the interoperability issue between the two networks needs to be enhanced so that WiFi can efficiently supplement for the cellular network in case of congestion or outage. In this paper, we propose a novel network roaming and selection scheme based on 3GPP TS 24.312 and IEEE 802.11k, u standards to enhance cellular and WiFi interworking. The proposed scheme is aimed at enhancing the network roaming and selection so that WiFi network can serve as a supplement and backup access network for the cellular not only for congestion control but also in case of unexpected network failure event. We also model and evaluate the proposed scheme in a typical HetNet with interworking WiFi access points and cellular base stations. The simulation result shows that our proposed scheme quickly detects unexpected network failure event and assists active UEs to perform handoff to preferable alternative point of access. As a result, service disruption is substantially reduced and quality of experience (downlink/uplink’s throughput) is improved. Therefore, our proposed scheme can be used for a more reliable HetNet in terms of congestion control and disruption tolerance.
Minimum Physical Hop (MPH) has been proposed as a peer selection algorithm for decreasing inter-AS (Autonomous System) traffic volume in P2P live streaming. In MPH, a newly joining peer selects a peer whose physical hop count (i.e., the number of ASes traversed on the content delivery path) from it is the minimum as its providing peer. However, MPH shows high inter-AS traffic volume when the number of joining peers is large. In this paper, we propose IMPH that tries to further decrease the inter-AS traffic volume by distributing peers with one logical hop count (i.e., the number of peers or origin streaming servers (OSSes) traversed on the content delivery path from an OSS to the peer) to many ASes and encouraging the following peers to find their providing peers within the same AS. Numerical examples show that IMPH achieves at the maximum of 64% lower inter-AS traffic volume than MPH.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
PERFORMANCES OF ORTHOGONAL WAVELET DIVISION MULTIPLEX (OWDM) SYSTEM UNDER AWG...IJCNCJournal
Orthogonal Wavelet Division Multiplexing (OWDM) has been considered as an alternative of Orthogonal
Frequency Division Multiplexing (OFDM) in the recent years. OWDM has lower computational complexity
and higher flexibility compared to its OFDM counterpart. The core component of OWDM is wavelet.
Wavelet has been a much investigated and applied topic in digital image processing for a long time.
Recently, it has drawn considerable attention of the researchers working in communication field. In this
work we investigate the performances of OWDM under different channel conditions. We consider three
channel conditions namely Additive White Gaussian Noise (AWGN), Rayleigh, Ricean, and frequency
selective. We consider a number of wavelets namely Haar, Daubechies, Biorthogonal, Reverse
Biorthogonal, Coiflets, and Symlets in OWDM design. For system model we choose Digital Video
Broadcasting-Terrestrial (DVB-T). Originally DVB-T system was designed based on OFDM. In this work
we use OWDM instead. The simulation results show OWDM outperforms OFDM in terms of bit error rate
(BER), noise resiliency, and peak-to-average ration. The results also show that the Haar wavelet based
OWDM outperforms other wavelets based OWDM system under all three considered three channel
conditions.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
FLEXIBLE VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORK WITH MINIMU...IJCNCJournal
In a conventional network, most network devices, such as routers, are dedicated devices that do not
have much variation in capacity. In recent years, a new concept of Network Functions
Virtualisation (NFV) has come into use. The intention is to implement a variety of network functions
with software on general-purpose servers and this allows the network operator to select any
capabilities and locations of network functions without any physical constraints.
This paper focuses on the deployment of NFV-based routing functions which are one of critical
virtual network functions, and present the algorithm of virtual routing function allocation that
minimize the total network cost. In addition, this paper presents the useful allocation policy of
virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy
takes the ratio of the cost of a routing function to that of a circuit and traffic distribution in the
network into consideration. Furthermore, this paper shows that there are cases where the use of
NFV-based routing functions makes it possible to reduce the total network cost dramatically, in
comparison to a conventional network, in which it is not economically viable to distribute smallcapacity
routing functions
GEOGRAPHIC MAPS CLASSIFICATION BASED ON L*A*B COLOR SYSTEMIJCNCJournal
Today any geographic information system (GIS) layers became vital part of any GIS system , and
consequently , the need for developing automatic approaches to extract GIS layers from different image
maps like digital maps or satellite images is very important.
Map classification can be defined as an image processing technique which creates thematic maps from
scanned paper maps or remotely sensed images. Each resultant theme will represent a GIS layer of the
images.
A new proposed approach to extract GIS layers (classes) automatically based on L*A*B colorsystem
selected from ( A and B ) is proposed in this paper, our experiments shows that the hsi color space gives
better than L*A*B.
ESTABLISHMENT OF VIRTUAL POLICY BASED NETWORK MANAGEMENT SCHEME BY LOAD EXPER...IJCNCJournal
In the current Internet-based systems, there are many problems using anonymity of the network
communication such as personal information leak and crimes using the Internet systems. This is because
the TCP/IP protocol used in Internet systems does not have the user identification information on the
communication data, and it is difficult to supervise the user performing the above acts immediately. As a
solution for solving the above problem, there is the approach of Policy-based Network Management
(PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication
control of every user. In this PBNM, two types of schemes exist. The first is the scheme for managing the
whole LAN by locating the communication control mechanisms on the course between network servers and
clients. The second is the scheme of managing the whole LAN by locating the communication control
mechanisms on clients. As the second scheme, we have been studied theoretically about the Destination
Addressing Control System (DACS) Scheme. By applying this DACS Scheme to Internet system
management, we intend to realize the policy-based Internet system management finally. In the DACS
Scheme, the inspection is not done about compatibility to cloud environment with virtualization technology
that spreads explosively. As the result, the coverage of the DACS Scheme is limited only in physical
environment now. In this study, we inspect compatibility of the DACS Scheme for the cloud environment
with virtualization technology, and enlarge coverage of this scheme. With it, the Virtual DACS Scheme
(vDACS Scheme) is established.
An energy aware scheme for layered chain in underwater wireless sensor networ...IJECEIAES
Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.
GRID-BASED PRIORITY ROUTING PROTOCOL FOR UWSNSIJCNCJournal
In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected
sensor nodes called cell-heads. The unique feature in GBPR is the classification of the neighboring cells in different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average delay and
packet delivery ratio.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
The Underwater Sensor Network (UWSN) is main interesting area due to its most valuable
applications like: disaster preventions, distributed tactical surveillance, undersea exploration, seismic
monitoring, environmental monitoring and many more. The design of energy efficient routing protocol
however is a challenging issue because in underwater environment the batteries of the sensor nodes
cannot be recharged easily. Majority of the researchers have adapted the terrestrial WSN methodologies
to overcome this problem but in underwater environment the terrestrial WSN approach is not feasible due
to the acoustic signaling and water current. This research paper focuses the key limitation of the current
energy efficient routing protocols. The simulation results with comparative analysis for energy efficient
routing protocols are also presented in this research article; which helps the researchers to find the further
research gap in the field of energy efficient routing protocols.
ENERGY-BALANCED IMPROVED LEACH ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKScscpconf
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
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.
Clustering and data aggregation scheme in underwater wireless acoustic sensor...TELKOMNIKA JOURNAL
Underwater Wireless Acoustic Sensor Networks (UWASNs) are creating attentiveness in
researchers due to its wide area of applications. To extract the data from underwater and transmit to
watersurface, numerous clustering and data aggregation schemes are employed. The main objectives of
clustering and data aggregation schemes are to decrease the consumption of energy and prolong the
lifetime of the network. In this paper, we focus on initial clustering of sensor nodes based on their
geographical locations using fuzzy logic. The probability of degree of belongingness of a sensor node to its
cluster, along with number of clusters is analysed and discussed. Based on the energy and distance the
cluster head nodes are determined. Finally using using similarity function data aggregation is analysed and
discussed. The proposed scheme is simulated in MATLAB and compared with LEACH algorithm.
The simulation results indicate that the proposed scheme performs better in maximizing network lifetime
and minimizing energy consumption.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility of each sensor nodes are measured through the water atmosphere from the water flow for sensor based protocol formations. Researchers have developed many routing protocols. However, those lost their charm with the time. This can be the demand of the age to supply associate degree upon energy-efficient and ascendable strong routing protocol for under water actuator networks. During this work, the authors tend to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use of total energy consumption and ensures packet transmission which redirects as an additional reliability in compare to different routing protocols. In this work, the authors have used the level of forwarding node, residual energy and distance from the forwarding node to the causing node as a proof in multicasting technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned protocol.
Similar to Fuzzy based clustering and energy efficient (20)
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.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
block diagram and signal flow graph representation
Fuzzy based clustering and energy efficient
1. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
DOI : 10.5121/ijcnc.2015.7203 33
FUZZY BASED CLUSTERING AND ENERGY EFFICIENT
ROUTING FOR UNDERWATER WIRELESS SENSOR
NETWORKS
Sihem Souiki1
, Mourad Hadjila1
and Mohammed Feham1
1
Department of Telecommunication, Tlemcen University, Algeria.
ABSTRACT
Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is
characterized by using acoustic channels for communication. UWSN is challenged by great issues specially
the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed
routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing
protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based
on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the
closeness to the center of the cluster, then the node having the higher residual energy elects itself as a
cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data
aggregation and transmits the data directly to the base station. The second algorithm uses the same
principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data
from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested
for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed
algorithms resulting in an extension of the network lifetime.
KEYWORDS
UWSN, Routing, Clustering, Fuzzy C-Means, Energy efficiency
1.INTRODUCTION
In recent years, underwater wireless sensor network has emerged as a powerful technique in order
to discover and exploit this harsh environment. As over 70% of the earth’s surface is covered by
water, it is advantageous to deploy underwater sensor networks to support several categories of
applications such as oceanographic data collection, pollution monitoring, offshore exploration,
disaster prevention, assisted navigation and tactical surveillance applications [1]. To make these
applications viable, there is a need to enable underwater communications among underwater
devices. The underwater communication may include the transmission of information in three
forms (sound, electromagnetic (EM), or optical waves). Each of these techniques has advantages
and drawbacks. Electromagnetic signals deliver very poor performance underwater, providing
transmission ranges of only a few meters at the typical RF sensor transmission power. Optical
communication for underwater sensor networks using light waves has also been investigated;
however these methods either require high precision or high power if the distances between
sensor nodes are large. Consequently, acoustic networks enabled by sound waves become ideal
alternatives since acoustic signals propagate well through water and require much less power than
RF and light signals for the same communication range [2].
2. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
34
An underwater sensor network is usually formed by several autonomous and individual sensor
nodes used to collect and forward data to the uw-sink. The most important challenges of
deploying such a network are the cost, the computational power, the memory, the communication
range and most of all the limited battery resources of each sensor node. The lifetime of UWSN is
largely restricted because the number of sensor nodes that stop working due to the energy wastage
increases with a deployment time. Then the high energy consumption is particularly significant
defy for researchers to achieve long operating time without affecting system performance.
Generally routing is the backbone for any network, and routing protocols are considered to be in
charge for discovering and maintaining the routes. Most of the proposed protocols for terrestrial
sensor networks cannot be immediately used in UWSN owing to the continuous exchange of
overhead messages applied (proactive ad hoc routing) or the route discovery process based on the
flooding technique (reactive ad hoc routing) although the major protocols are designed for a
stationary deployment, thus these solutions are ineffective in large scale UWSN because they
exhaust energy and bandwidth resources. Therefore new energy efficient protocols must be
designed for UWSN.
In this paper we present a hierarchical fuzzy based energy efficient routing algorithms where the
clusters are formed by the Fuzzy C-Means method. The nodes are deployed randomly in three
dimensional environments. The first proposed algorithm employs a single hop transmission
between cluster heads and the uw-sink. Whereas the second proposition uses the multihop
transmission between cluster heads and uw-sink; both algorithms are simulated for static and
dynamic topologies.
The remainder of the paper is organized as follows. In section 2, a related work on hierarchical
routing in both terrestrial and underwater wireless sensor networks are presented. Section 3 gives
a detail description of our routing algorithms simulated in static and dynamic topologies. Section
4 shows the simulations results. Finally, the last section concludes the paper.
2. RELATED WORKS
Energy saving is a primordial issue in UWSNs because sensor nodes are supplied by batteries,
which are difficult to replace or recharge in hostile underwater environments. Designing robust,
scalable and energy aware routing protocols in this kind of networks is a fundamental research
challenge. In the ground based wireless sensor networks, numerous routing protocols have been
developed which can be divided into following classes according to deployment: flat,
geographical, and hierarchal routing. In a flat topology, all nodes perform the same tasks and have
the same functionalities in the network. Data transmission is performed by flooding in hop by hop
manner. Flooding [3], Gossiping [4] and SPIN [5] are example of flat routing protocols. The
second class is based on the position information of each node to determine forwarding path. The
typical geographic routing protocols in WSNs include [6,7].Owing to satisfy the scalability aim
and extending network lifetime in WSN, grouping nodes into clusters has been widely adopted by
the research community. The hierarchical routing protocols involve cluster-based structure of the
sensor nodes. Generally, each cluster constitutes a leader referred to as cluster head (CH) usually
performs the special tasks (fusion and aggregation) and other member nodes (collection of data
and monitoring). The first clustering routing protocol proposed for WSNs includes Low-energy
Adaptive Clustering Hierarchy (LEACH) [8]. The key idea of this protocol is to select randomly a
set of sensor nodes as cluster head and rotate this task to uniformly distribute the energy load
among the nodes in the network. There are two phases of LEACH protocol: The setup and steady
phases. Firstly, in the setup phase clusters are formed and the cluster head (CH) selection is
performed by the member nodes. Secondly the cluster head (CH) compress the gathered data
3. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
35
from diverse nodes that belong to the respective cluster. Then the cluster head forwards
aggregated data to the base station by single hop communication. Multiple variants of LEACH
protocol are proposed to overcome some drawbacks of this protocol such as: LEACH-C [9], MR-
LEACH [10] and HEED [11].
However, these protocols are not appropriate for UWSNs because they assume that the sensor
network is stationary and they are not well adapted to the intrinsic properties of underwater
environments, such as long propagation delays, low data rates and difficulty of synchronization.
On the other hand, some hierarchical routing protocols have been designed for UWSN such as
Ducs [12], Mccp [13] and HydroCast [14].
DUCS protocol is designed for long-term non-time critical applications where the sensor nodes
are grouped into clusters using a distributed algorithm. The protocol operates in two stages: the
first stage containing the clusters formation and the selection of the cluster head based on the
remaining energy. In addition a randomized rotation of CH is performed among different nodes
within a cluster in order to alleviate fast draining of the sensor node energy. In the second stage
the data are transmitted to the sink using multi-hop routing through other cluster heads.
In MCCP protocol (Minimum Cost Clustering Protocol), the clusters are created based on a cost
metric. The cost metric is calculated on the basis of three important parameters: (1) the total
energy consumption of the cluster members for sending data to the cluster head; (2) the residual
energy of the cluster head and its cluster members; and (3) the relative location between the
cluster head and the uw-sink. The proposed protocol selects a set of non-overlapping clusters
from all potential clusters based on the cost metric affected to each potential cluster and attempts
to reduce the cost of the selected clusters. MCCP can adapt geographical cluster head distribution
to the traffic pattern in the network and thus avoid the formation of hot spots around the uw-sink.
It can also balance the traffic load between cluster heads and cluster members through periodical
re-clustering the sensor nodes in the network.
The global idea of HydroCast is based on a routing decision which is made after comparing the
local pressure or depth information, such that data packets are greedily forwarded towards a node
with the lowest pressure level among the neighbor nodes. In HydroCast scheme, each local
maximum node maintains a recovery route towards a neighboring node with higher depth than
itself. After one or several forwarding’s through local maxima, a data packet can be routed out of
the void region and can be switched back to the greedy mode.
3. THE PROPOSED ALGORITHMS
In the following, we briefly introduce the basic theory of Fuzzy C-Means (FCM) used in cluster
formation of our propositions, and then we give a detailed description of the proposed
approaches.
3.1. Basic theory of Fuzzy C-Means
Fuzzy C-Means clustering algorithm [15], is a kind of clustering algorithm using membership to
describe the possibility of cluster. However FCM is a local optimization algorithm, which is very
sensitive to initialization and gets into the local minimum value easily.
The finite vectors xi (i=1, 2,…, n) are divided into c (1<c<n) classes, and the clustering center of
each class is solved to make membership minimum as the non-similarity index.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
36
The objective function can be defined as follows:
JሺU, cଵ, cଶ … cୡሻ = U ୧୨
୫
୬
୨
ୡ
୧ୀଵ
d ୧୨
ଶ
ሺ1ሻ
Where Uij is the membership of the group, ci is the clustering center; dij is the special distance
from vector ci to xj. m is the weighted index.
The steps of algorithm are as the following:
• Initializing the membership matrix U to make it satisfy the following formula.
U୧୨ =
ୡ
୧ୀଵ
1, ∀j = 1, … , n ሺ2ሻ
• Calculating the clustering center using the following formula.
c୧ =
∑ U୧୨
୫
x୨
୬
୨ୀଵ
∑ U୧୨
୫୬
୨ୀଵ
ሺ3ሻ
• Calculating the objective function according to the formula (1). If the objective function is
less than a threshold or the relative value function change value last time is less than a
threshold, the algorithm stops.
• Updating the matrix by the following formula and returning to step2.
U୧୨ = ሺ
d୧୨
d୩୨
ሻ
ିଶ
୫ିଵൗ
ୡ
୩ୀଵ
ሺ4ሻ
3.2. Single-Hop Fuzzy based Energy Efficient Routing algorithm for UWSN (SH-
FEER):
SH-FEER is a fuzzy based energy efficient algorithm where clusters are formed by using the
Fuzzy C-Means method. We suppose that underwater sensor nodes always have data to be sent to
the sink and the set of nodes have the same amount of energy [16].
We assume in this approach that the nodes organize themselves inside clusters randomly with
unequal sizes and one node is selected as a cluster-head for each cluster. All non-cluster head
nodes forward their data to their cluster head via a single hop; the cluster-head node receives data
from all cluster members, performs signal processing functions on the data (e.g. aggregation) and
transmits the data to the sink using single-hop routing. The cluster heads are responsible for
coordination among nodes within their clusters (intra-cluster coordination) and communication
between each other (inter-cluster coordination).
SH-FEER incorporates rotation of the cluster-head among the sensors to avoid rapid draining of
the batteries of specific underwater sensors. In this way, the energy consumption is distributed.
The operation mode of SH-FEER is composed to three phases: clusters formation during the first
5. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
37
step and secondly the cluster head are selected. Initially, the closest node to the center is selected
as cluster head and in the next rounds the selection is based on the residual energy of each node;
the third step is the transmission of data towards the sink.
The algorithm of this first proposition is mentioned as follows:
Step 1: Clusters formation
Apply FCM algorithm to form clusters.
- Each cluster K(i) contains a number of nodes, i=1, …, N
- Initially all nodes have the same amount of energy.
Step 2: Cluster head selection
maxE=zeros(1,N) ;
maxE is a row vector contains N zeros
R_max: maximum number of rounds
TE: total energy of network
while(R≤R_max || TE>0)
for i = 1 to N do
if R==1
-calculate the distance d (nodei ,center) // between nodei and center of cluster.
-Assign ICH (i) of the cluster in which d(nodei , center) is minimum.
else
for j=1 to length(k(i)) do
ifmaxE(i)<k(i).E(j)
maxE(i)=k(i).E(j)
end if
end for
CH(i)=maxE(i)
end if
end for
Step 3: Data transmission
• Intra_cluster transmission
for i = 1 to N do
for j=1 to length(k(i)) do
k(i).j send data to CH(i)
end for
end for
• Transmission from CHs to the uw-sink
for i = 1 to N do
CH(i) aggregates and forwards directly the data to uw-sink
end for.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
38
3.3. Multi-Hop Fuzzy based Energy Efficient Routing algorithm for UWSN (MH-
FEER):
MH-FEER mimics the first proposed algorithm; it uses the same two first phases of SH-FEER
(clusters formation and cluster head selection). However the process of data forwarding toward
the uw-sink is different by using multi-hop routing between cluster heads and uw-sink. The data
are transferred through multiple cluster-heads in the direction of the uw-sink choosing the shortest
path; this is repeated until it reaches the uw-sink.
Since the mode of clusters formation and the cluster heads selection is the same as the first
algorithm, we present below only the pseudo-code relating to the data forwarding from the cluster
heads to uw-sink.
Calculation of distances between CHs and distances between CHs and uw-sink
For i=1 to N
For j=1 to N do
dሺi, jሻ = ට൫x୧ − x୨൯
ଶ
+ ൫y୧ − y୨൯
ଶ
+ ൫z୧ − z୨൯
ଶ
d୳୵ିୱ୧୬୩ሺiሻ = ඥሺx୧ − x୳୵ିୱ୧୬୩ሻଶ + ሺy୧ − y୳୵ିୱ୧୬୩ሻଶ + ሺz୧ − z୳୵ିୱ୧୬୩ሻଶ
end for
for i=1 to N do
ifduw-sink (i)== Min duw-sink
CH(i) sends directly to uw-sink
else
for j=1 to N do
if(i≠j&& d(i,j)==min(i) &&d uw-sink (i) > d uw-sink (j))
CH(i) sends data to CH(j)
end if
end for
end if
end for
4. PERFORMANCE EVALUATION
In this section, we evaluate the performance of the proposed algorithms through extensive
simulations under Matlab environment. Firstly, we define the performance metrics and the
simulation methodology, and then we present the energy model used. Moreover we evaluate how
network parameters such as node density, node mobility affect the performance of the proposed
algorithms.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
39
4.1. Metrics and Methodology
4.1.1. Metrics
In this paper two metrics are used to analyze the performance of the proposed algorithms: total
energy consumption and the number of alive nodes
(i) Total energy consumption ET: is the sum of energy amount consumed by the all sensor
nodes formed the networks
E(i)consumed = E(i)initial-E(i)residual
ETconsumed = ∑ Eሺiሻ
୧ୀଵ ୡ୭୬ୱ୳୫ୣୢ
(ii) Number of alive nodes: is the number of sensor nodes where the energy is different to 0
during (r) rounds.
4.1.2. Simulation Methodology
In our simulation we make some assumptions then we present the energy model used.
• Assumptions
- Sensor nodes as well as the uw-sink are stationary after being deployed in the field.
- The network is considered homogeneous and all of the sensor nodes have the same initial
energy.
- Each sensor node knows its own geographical position.
- The underwater sink is not limited in terms of energy, memory and computational power.
- Underwater sink is located outside the area of the sensors nodes (at the surface).
- All nodes measure the environmental parameters at a fixed rate and send it periodically to the
receiver nodes.
- Each sensor node can operate either in sensing mode to monitor the environment parameters and
transmit to the underwater sink, cluster head (to compress and forward it to the uw-sink).
The Parameters setting of the simulation are shown in Table1
Table 1. Simulation parameters
Parameters Values
Network size (100*100*100) m3
Number of nodes 100
Initial energy 10 J
Coordinate of the sink (50, 50,150)
• Energy model
We use the same energy model as used in [17], which was proposed for underwater acoustic
networks. According to this model, to achieve a power level P0 at a receiver at a distance d, the
transmitter power Etx(d) must be:
8. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
40
Etx (d) = P0 . d2
. 10
ಉሺሻ
భబ
Where αሺfሻ , measured in dB/m, is a medium absorption coefficient depending on the frequency
range of interest under given water temperature and salinity, αሺfሻ is given by
αሺfሻ = 0.11
10ିଷ
fଶ
1 + fଶ
+ 44
10ିଷ
fଶ
4100 + fଶ
+ 2.75 ൈ 10ି
fଶ
+ 3 ൈ 10ି
Where f is the carrier frequency for transmission in KHz. The reception power is assumed to 1/3th
of the transmission power.
4.2. Simulation1: static topology
The figure 1 depicts the total energy consumption of the two proposed algorithms and a
comparison is performed with the direct transmission. As shown in this figure we observe that
the MH-FEER algorithm consumes less energy comparing with SH-FEER, this is due to the
multi-hop routing used between cluster heads and the sink i.e. MH-FEER avoid the long distances
transmission utilized in the SH-FEER between CH and the sink. Although this figure shows that
the energy depletion of the two proposed algorithms is better than the direct transmission.
Figure 1. Total energy consumption vs. number of rounds Figure 2. Alive nodes vs. number of rounds
From the simulation result shown in figure 2 and 3, we can see that the first node dies in direct
transmission algorithm after 30 rounds while in SH-FEER and MH-FEER first node dies after 87
and 31 rounds respectively. We also observe that the last node dies in direct transmission
algorithm after 89 rounds while in SH-FEER and MH-FEER last node dies after 162 and 241
rounds respectively. Therefore, in this set of simulations, we note that MH-FEER about 32.78 %
more efficient in term of network lifetime compared to SH-FEER and about 63.07 % than the
direct transmission algorithm.
Furthermore, the number of alive nodes decreases speedily with direct transmission and SH-
FEER cases in comparing to the MH-FEER algorithm.
0 50 100 150 200 250
0
100
200
300
400
500
600
700
800
900
1000
Number of rounds
Totalenergyconsumption
MH-FEER
SH-FEER
Direct Transmission
0 50 100 150 200 250
0
10
20
30
40
50
60
70
80
90
100
Number of rounds
Alivenodes
MH-FEER
SH-FEER
Direct Transmission
9. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
41
Figure 3. The first and last node died in static topology
4.3. Simulation 2: dynamic topology
On account of the environment’s impact, underwater sensor nodes will be dynamic, which
produces changes in topology. Consequently, to will be more close to reality we must introduce
the movement to the simulation conditions. Considering this situation, we have used a random
walk mobility model, the node mobility is taken as 1 m/s and the other environmental parameters
are similar with the static simulation.
For the same number of nodes in the network, the figure 4 also shows that the total energy
consumption in dynamic networks is significantly high comparing to the static networks.
Furthermore, the number of alive nodes decreases speedily comparing to the static cases
(29.37%).
Figure 4. Total energy consumption vs. number of rounds Figure 5. Alive nodes vs. number of rounds
0 20 40 60 80 100 120 140
0
100
200
300
400
500
600
700
800
900
1000
Number of rounds
Totalenergyconsumption
MH-FEER
SH-FEER
Direct Transmission
0 20 40 60 80 100 120 140
0
10
20
30
40
50
60
70
80
90
100
Number of rounds
Alivenodes
MH-FEER
SH-FEER
Direct Transmission
10. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
42
From the simulation result shown in figure 5 and 6, we can see that the first node dies in direct
transmission algorithm after 30 rounds while in SH-FEER and MH-FEER first node dies after 96
and 108 rounds respectively. We also observe that the last node dies in direct transmission
algorithm after 77 rounds while in SH-FEER and MH-FEER last node dies after 117 and 128
rounds respectively. Therefore, in this set of simulation we note that MH-FEER about 8.5% is
more efficient in term of network lifetime comparing to SH-FEER and about 39.84 % versus to
the direct transmission algorithm.
Figure 6. The first and last node died in dynamic topology
4.4. Impact of density and mobility
In order to check the effect of density and mobility we choose the second proposition MH-FEER
in this set of simulations where all nodes are mobile with the same speed and we change the
number of nodes from 200 to 1000 nodes, the simulations results are plotted in the following
figures.
Figure 7. Impact of density on energy consumption Figure 8. Impact of density on alive node
Figures 7 and 8 depict the impact of density on the total energy consumption and the alive node
respectively. The total energy consumption increases when the number of nodes increases since
0 20 40 60 80 100 120 140 160 180
0
1000
2000
3000
4000
5000
6000
7000
8000
9000
10000
Number of rounds
Totalenergyconsumption
1000 node
800 node
600 node
400 node
200 node
0 20 40 60 80 100 120 140 160 180
0
100
200
300
400
500
600
700
800
900
1000
Number of rounds
Alivenodes
1000 node
800 node
600 node
400 node
200 node
11. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
43
more nodes are involved in packet transmission. However the number of alive nodes remains
stable but it’s eventually decreased rapidly.
In this section of simulation we vary the mobility speed of each node from 1.5 m/s to 5.5 m/s
when using 100 nodes.
Figure 9.Impact of mobility on energy consumption Figure 10. Impact of mobility on alive nodes
It can be seen from figure 9 that the total energy consumption increases with the growth of the
node speed, however, the number of alive nodes reduces more when increasing the speed as
illustrated in figure 10.
5. CONCLUSION
In this paper we address the issue of routing energy efficiency in underwater wireless sensor
networks. Firstly, we have proposed two algorithms which utilize a clustering method based on
Fuzzy C-Means, using these algorithms; we study the effect of two key parameters (scalability
and mobility) on the performance of UWSN. Moreover theses approaches are deployed on static
and mobile environments. The simulation results show a promising performance, in terms of
energy consumption and network lifetime, with the proposed SH-FEER and MH-FEER
algorithms, than the direct transmission. In the future works we aim to investigate intelligent
algorithms such as genetic algorithms or ant colony, specially to find the shortest path between
the cluster heads and the underwater sink.
0 20 40 60 80 100 120
0
100
200
300
400
500
600
700
800
900
1000
Number of rounds
Totalenergyconsumption
speed=1.5
speed=3.5
speed=5.5
0 20 40 60 80 100 120
0
10
20
30
40
50
60
70
80
90
100
Number of rounds
Alivenodes
speed=1.5
speed=3.5
speed=5.5
12. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.2, March 2015
44
REFERENCES
[1] I.F. Akyildiz, D. Pompili, and T. Melodia, "Underwater acoustic sensor networks: Research
challenges", Ad Hoc Networks, pp. 257–279, 2005.
[2] L. Liu, S. Zhou, and J.H .Cui, "Prospects and Problems of Wireless Communication for Underwater
Sensor Networks", WILEY WCMC, pp. 977-994, 2008.
[3] Z.J. Haas, J.Y. Halpern and L. Li, "Gossip-Based Ad Hoc Routing", Proceedings of the 19th
Conference of the IEEE Communications Society (INFOCOM), pp. 1707–1716, 2002.
[4] J. Kulik, W.R. Heinzelman and H. Balakrishnan, "Negotiation based protocols for disseminating
information in wireless sensor networks", Wirel.Netw, pp. 169–185, 2002.
[5] C. Intanagonwiwat, R. Govindan, D. Estrin and J.Heidemann, "Directed diffusion for wireless sensor
networking", IEEE/ACM Trans.Netw, pp. 2–16, 2003.
[6] Y. Xiu, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for ad-hoc routing",
Proceedings ACM/IEEE MobiCom'01, pp. 70-84, 2001.
[7] Y. Yu, R. Govindan, and D.Estrin, "Geographical and energy aware routing: A recursive data
dissemination protocol for wireless sensor networks", Technical Report UCLA/CSD-TR-01-0023,
UCLA Computer Science Department, 2001.
[8] W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, "Energy-Efficient Communication Protocol for
Wireless Microsensor Networks", In Proceedings of the 33rd Annual Hawaii International
Conference on System Sciences, pp. 10–19, 2000.
[9] W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, "An application-specific protocol
architecture for wireless microsensor networks", Wireless Commun, pp. 660–670, 2002.
[10] A.B. Dogar, G.A. Shah and M.O. Farooq, "MR-LEACH: Multi-hop routing with low energy adaptive
clustering hierarchy", Fourth International Conference on Sensor Technologies and Applications
(SENSORCOMM), pp. 262-268, 2010.
[11] O. Younis, S. Fahmy, "A hybrid energy-efficient, distributed clustering approach for ad hoc sensor
networks", Mobile Comput, IEEE Trans, pp. 366–79, 2004.
[12] M.C. Domingo, R. Prior, "A distributed clustering scheme for underwater wireless sensor networks.
in personal, indoor and mobile radio communications", Proceedings of the IEEE 18th International
Symposium on PIMRC,2007.
[13] W. Pu, L. Cheng and Z. Jun, "Distributed minimum-cost clustering protocol for underwater sensor
networks (UWSNs) ", Proceedings of the IEEE international conference on communications, ICC ’07,
2007.
[14] L. Uichin, et al., "Pressure routing for underwater sensor networks", Proceedings of the IEEE
INFOCOM, 2010.
[15] M. Zhang, J. Yu, "Fuzzy partitional clustering algorithms", J journal of Software, pp.6-859, 2004.
[16] M. Hadjila, H. Guyennet and M. Feham, "Energy-Efficient in Wireless Sensor Networks using Fuzzy
C-Means Clustering Approach", International Journal of Sensors and Sensor Networks, pp. 21-26,
2013.
[17] E. Sozer, M. Stojanovic, and J. Proakis, "Underwater acoustic networks", IEEE Journal of Oceanic
Engineering, pp. 72-83, 2000.