1,654 research outputs found
Socially-Aware Networking: A Survey
The widespread proliferation of handheld devices enables mobile carriers to
be connected at anytime and anywhere. Meanwhile, the mobility patterns of
mobile devices strongly depend on the users' movements, which are closely
related to their social relationships and behaviors. Consequently, today's
mobile networks are becoming increasingly human centric. This leads to the
emergence of a new field which we call socially-aware networking (SAN). One of
the major features of SAN is that social awareness becomes indispensable
information for the design of networking solutions. This emerging paradigm is
applicable to various types of networks (e.g. opportunistic networks, mobile
social networks, delay tolerant networks, ad hoc networks, etc) where the users
have social relationships and interactions. By exploiting social properties of
nodes, SAN can provide better networking support to innovative applications and
services. In addition, it facilitates the convergence of human society and
cyber physical systems. In this paper, for the first time, to the best of our
knowledge, we present a survey of this emerging field. Basic concepts of SAN
are introduced. We intend to generalize the widely-used social properties in
this regard. The state-of-the-art research on SAN is reviewed with focus on
three aspects: routing and forwarding, incentive mechanisms and data
dissemination. Some important open issues with respect to mobile social sensing
and learning, privacy, node selfishness and scalability are discussed.Comment: accepted. IEEE Systems Journal, 201
A Survey of Delay Tolerant Networks Routing Protocols
Advances in Micro-Electro-Mechanical Systems (MEMS) have revolutionized the
digital age to a point where animate and inanimate objects can be used as a
communication channel. In addition, the ubiquity of mobile phones with
increasing capabilities and ample resources means people are now effectively
mobile sensors that can be used to sense the environment as well as data
carriers. These objects, along with their devices, form a new kind of networks
that are characterized by frequent disconnections, resource constraints and
unpredictable or stochastic mobility patterns. A key underpinning in these
networks is routing or data dissemination protocols that are designed
specifically to handle the aforementioned characteristics. Therefore, there is
a need to review state-of-the-art routing protocols, categorize them, and
compare and contrast their approaches in terms of delivery rate, resource
consumption and end-to-end delay. To this end, this paper reviews 63 unicast,
multicast and coding-based routing protocols that are designed specifically to
run in delay tolerant or challenged networks. We provide an extensive
qualitative comparison of all protocols, highlight their experimental setup and
outline their deficiencies in terms of design and research methodology. Apart
from that, we review research that aims to exploit studies on social networks
and epidemiology in order to improve routing protocol performance. Lastly, we
provide a list of future research directions.Comment: 56 page
Modeling Human Mobility and its Applications in Routing in Delay-Tolerant Networks: a Short Survey
Human mobility patterns are complex and distinct from one person to another.
Nevertheless, motivated by tremendous potential benefits of modeling such
patterns in enabling new mobile services and technologies, researchers have
attempted to capture salient characteristics of human mobility. In this short
survey paper, we review some of the major techniques for modeling humans'
co-location, as well as predicting human location and trajectory. Further, we
review one of the most important application areas of such models, namely,
routing in delay-tolerant networks
Data Dissemination in Opportunistic Networks
Mobile devices integrating wireless short-range communication technologies
make possible new applications for spontaneous communication, interaction and
collaboration. An interesting approach is to use collaboration to facilitate
communication when mobile devices are not able to establish direct
communication paths. Opportunistic networks, formed when mobile devices
communicate with each other while users are in close proximity, can help
applications still exchange data in such cases. In opportunistic networks
routes are built dynamically, as each mobile device acts according to the
store-carry-and-forward paradigm. Thus, contacts between mobile devices are
seen as opportunities to move data towards destination. In such networks data
dissemination is done using forwarding and is usually based on a
publish/subscribe model. Opportunistic data dissemination also raises questions
concerning user privacy and incentives. Such problems are addressed differently
by various opportunistic data dissemination techniques. In this paper we
analyze existing relevant work in the area of data dissemination in
opportunistic networks. We present the categories of a proposed taxonomy that
captures the capabilities of data dissemination techniques used in such
networks. Moreover, we survey relevant data dissemination techniques and
analyze them using the proposed taxonomy.Comment: Please cite this as "Radu Ciobanu, Ciprian Dobre, Data Dissemination
in Opportunistic Networks, in Proc. of 18th International Conference on
Control Systems and Computer Science (CSCS-18), Bucharest, Romania, 2011, pp.
529-536, ISSN: 2066-4451, Politehnica Press
SDDV: scalable data dissemination in vehicular ad hoc networks
An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations
Determining the network throughput and flow rate using GSR And AAL2R
In multi-radio wireless mesh networks, one node is eligible to transmit
packets over multiple channels to different destination nodes simultaneously.
This feature of multi-radio wireless mesh network makes high throughput for the
network and increase the chance for multi path routing. This is because the
multiple channel availability for transmission decreases the probability of the
most elegant problem called as interference problem which is either of
interflow and intraflow type. For avoiding the problem like interference and
maintaining the constant network performance or increasing the performance the
WMN need to consider the packet aggregation and packet forwarding. Packet
aggregation is process of collecting several packets ready for transmission and
sending them to the intended recipient through the channel, while the packet
forwarding holds the hop-by-hop routing. But choosing the correct path among
different available multiple paths is most the important factor in the both
case for a routing algorithm. Hence the most challenging factor is to determine
a forwarding strategy which will provide the schedule for each node for
transmission within the channel. In this research work we have tried to
implement two forwarding strategies for the multi path multi radio WMN as the
approximate solution for the above said problem. We have implemented Global
State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e.
both packet forwarding and packet aggregation. After the successful
implementation the network performance has been measured by means of simulation
study
Survey of Important Issues in UAV Communication Networks
Unmanned Aerial Vehicles (UAVs) have enormous potential in the public and
civil domains. These are particularly useful in applications where human lives
would otherwise be endangered. Multi-UAV systems can collaboratively complete
missions more efficiently and economically as compared to single UAV systems.
However, there are many issues to be resolved before effective use of UAVs can
be made to provide stable and reliable context-specific networks. Much of the
work carried out in the areas of Mobile Ad Hoc Networks (MANETs), and Vehicular
Ad Hoc Networks (VANETs) does not address the unique characteristics of the UAV
networks. UAV networks may vary from slow dynamic to dynamic; have intermittent
links and fluid topology. While it is believed that ad hoc mesh network would
be most suitable for UAV networks yet the architecture of multi-UAV networks
has been an understudied area. Software Defined Networking (SDN) could
facilitate flexible deployment and management of new services and help reduce
cost, increase security and availability in networks. Routing demands of UAV
networks go beyond the needs of MANETS and VANETS. Protocols are required that
would adapt to high mobility, dynamic topology, intermittent links, power
constraints and changing link quality. UAVs may fail and the network may get
partitioned making delay and disruption tolerance an important design
consideration. Limited life of the node and dynamicity of the network leads to
the requirement of seamless handovers where researchers are looking at the work
done in the areas of MANETs and VANETs, but the jury is still out. As energy
supply on UAVs is limited, protocols in various layers should contribute
towards greening of the network. This article surveys the work done towards all
of these outstanding issues, relating to this new class of networks, so as to
spur further research in these areas.Comment: arXiv admin note: substantial text overlap with arXiv:1304.3904 by
other author
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
What you lose when you snooze: how duty cycling impacts on the contact process in opportunistic networks
In opportunistic networks, putting devices in energy saving mode is crucial
to preserve their battery, and hence to increase the lifetime of the network
and foster user participation. A popular strategy for energy saving is duty
cycling. However, when in energy saving mode, users cannot communicate with
each other. The side effects of duty cycling are twofold. On the one hand, duty
cycling may reduce the number of usable contacts for delivering messages,
increasing intercontact times and delays. On the other hand, duty cycling may
break long contacts into smaller contacts, thus also reducing the capacity of
the opportunistic network. Despite the potential serious effects, the role
played by duty cycling in opportunistic networks has been often neglected in
the literature. In order to fill this gap, in this paper we propose a general
model for deriving the pairwise contact and intercontact times measured when a
duty cycling policy is superimposed on the original encounter process
determined only by node mobility. The model we propose is general, i.e., not
bound to a specific distribution of contact and intercontact times, and very
accurate, as we show exploiting two traces of real human mobility for
validation. Using this model, we derive several interesting results about the
properties of measured contact and intercontact times with duty cycling: their
distribution, how their coefficient of variation changes depending on the duty
cycle value, how the duty cycling affects the capacity and delay of an
opportunistic network. The applicability of these results is broad, ranging
from performance models for opportunistic networks that factor in the duty
cycling effect, to the optimisation of the duty cycle to meet a certain target
performance.Comment: Accepted for publication on ACM Transactions on Modeling and
Performance Evaluation of Computing Systems (ToMPECS
PIPeR: Impact of power-awareness on social-based opportunistic advertising
Interest and social-awareness can be valuable determinants in decisions related to content delivery in mobile environments. Under certain conditions, we can deliver content with less cost and better delivery ratios, while only involving users that are interested in the type of content being delivered. However, the depletion of valuable power resources poses a deterrent to node participation in such interest-aware forwarding systems. No significant research contribution has been identified to collectively maximize the benefits of social, interest, and power awareness. In this work, we propose a new algorithm called PIPeR which integrates power awareness with an interest and socially aware forwarding algorithm called IPeR. Through simulations, we present and evaluate four modes of PIPeR. The results show that PIPeR is more fair and preserves at least 22% of the power IPeR consumes with less delay, while relying significantly on interested forwarders and with comparable cost to maintain similar delivery ratios
- …