8,490 research outputs found
From carbon nanotubes and silicate layers to graphene platelets for polymer nanocomposites
In spite of extensive studies conducted on carbon nanotubes and silicate layers for their polymer-based nanocomposites, the rise of graphene now provides a more promising candidate due to its exceptionally high mechanical performance and electrical and thermal conductivities. The present study developed a facile approach to fabricate epoxyâgraphene nanocomposites by thermally expanding a commercial product followed by ultrasonication and solution-compounding with epoxy, and investigated their morphologies, mechanical properties, electrical conductivity and thermal mechanical behaviour. Graphene platelets (GnPs) of 3.5
Multihop clustering algorithm for load balancing in wireless sensor networks
The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach
Analyzing Energy-efficiency and Route-selection of Multi-level Hierarchal Routing Protocols in WSNs
The advent and development in the field of Wireless Sensor Networks (WSNs) in
recent years has seen the growth of extremely small and low-cost sensors that
possess sensing, signal processing and wireless communication capabilities.
These sensors can be expended at a much lower cost and are capable of detecting
conditions such as temperature, sound, security or any other system. A good
protocol design should be able to scale well both in energy heterogeneous and
homogeneous environment, meet the demands of different application scenarios
and guarantee reliability. On this basis, we have compared six different
protocols of different scenarios which are presenting their own schemes of
energy minimizing, clustering and route selection in order to have more
effective communication. This research is motivated to have an insight that
which of the under consideration protocols suit well in which application and
can be a guide-line for the design of a more robust and efficient protocol.
MATLAB simulations are performed to analyze and compare the performance of
LEACH, multi-level hierarchal LEACH and multihop LEACH.Comment: NGWMN with 7th IEEE Inter- national Conference on Broadband and
Wireless Computing, Communication and Applications (BWCCA 2012), Victoria,
Canada, 201
Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs
Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the âhot spotsâ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method
Unified clustering and communication protocol for wireless sensor networks
In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the âUnified Clustering and Communication Protocol â (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms â wireless sensor networks, unified communication, optimization, clustering and quality of service
The Energy Complexity of Broadcast
Energy is often the most constrained resource in networks of battery-powered
devices, and as devices become smaller, they spend a larger fraction of their
energy on communication (transceiver usage) not computation. As an imperfect
proxy for true energy usage, we define energy complexity to be the number of
time slots a device transmits/listens; idle time and computation are free.
In this paper we investigate the energy complexity of fundamental
communication primitives such as broadcast in multi-hop radio networks. We
consider models with collision detection (CD) and without (No-CD), as well as
both randomized and deterministic algorithms. Some take-away messages from this
work include:
1. The energy complexity of broadcast in a multi-hop network is intimately
connected to the time complexity of leader election in a single-hop (clique)
network. Many existing lower bounds on time complexity immediately transfer to
energy complexity. For example, in the CD and No-CD models, we need
and energy, respectively.
2. The energy lower bounds above can almost be achieved, given sufficient
() time. In the CD and No-CD models we can solve broadcast using
energy and energy,
respectively.
3. The complexity measures of Energy and Time are in conflict, and it is an
open problem whether both can be minimized simultaneously. We give a tradeoff
showing it is possible to be nearly optimal in both measures simultaneously.
For any constant , broadcast can be solved in
time with
energy, where is the diameter of the network
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
MODLEACH: A Variant of LEACH for WSNs
Wireless sensor networks are appearing as an emerging need for mankind.
Though, Such networks are still in research phase however, they have high
potential to be applied in almost every field of life. Lots of research is done
and a lot more is awaiting to be standardized. In this work, cluster based
routing in wireless sensor networks is studied precisely. Further, we modify
one of the most prominent wireless sensor network's routing protocol "LEACH" as
modified LEACH (MODLEACH) by introducing \emph{efficient cluster head
replacement scheme} and \emph{dual transmitting power levels}. Our modified
LEACH, in comparison with LEACH out performs it using metrics of cluster head
formation, through put and network life. Afterwards, hard and soft thresholds
are implemented on modified LEACH (MODLEACH) that boast the performance even
more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH),
MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold
(MODLEACHST) is undertaken considering metrics of throughput, network life and
cluster head replacements.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
- âŠ