共查询到20条相似文献,搜索用时 0 毫秒
1.
An improved implementation of a post-detection packet combining scheme, which is especially applicable to low power, resource-constrained sensor networks, is developed and practically implemented on popular off-the-shelf wireless motes. The algorithm can be used as part of protocols such as cooperative communications and hybrid-ARQ schemes which have been shown to be of major benefit for wireless communications. Using the packet combining implementation developed in this paper more than an 85% reduction in energy costs are possible over previous, similar approaches. Both simulated and practical experiments are developed in which packet combining is shown to offer up to approximately 2.5 dB reduction in the required Signal-to-Noise Ratio (SNR) for a desired Packet Error Rate (PER). This is a welcome result as complex schemes, such as maximal-ratio combining, are not implementable on many of the resource constrained devices under consideration. 相似文献
2.
JaeSheung Shin Kyounghwan Lee Aylin Yener Thomas F. La Porta 《Mobile Networks and Applications》2006,11(4):593-611
There has been much recent attention on using wireless relay networks to forward data from mobile nodes to a base station.
This network architecture is motivated by performance improvements obtained by leveraging the highest quality links to a base
station for data transfer. With the advent of agile radios it is possible to improve the performance of relay networks through
intelligent frequency assignments. First, it is beneficial if the links of the relay network are orthogonal with respect to
each other so that simultaneous transmission on all links is possible. Second, diversity can be added to hops in the relay
network to reduce error rates. In this paper we present algorithms for forming such relay networks dynamically. The formation
algorithms support intelligent frequency assignments and diversity setup. Our results show that algorithms that order the
sequence in which nodes join a relay network carefully, achieve the highest amount of diversity and hence best performance.
This research is supported in part by NSF grant CNS-0508114.
JaeSheung Shin received the B.S. and M.S. degree in Computer Science and Engineering from DongGuk University, Korea, in 1991 and 1993, respectively.
He is currently working toward the Ph.D. degree in Computer Science and Engineering at the Pennsylvania State University,
University Park. He is a research assistant at the Networking and Security Research Center (NSRC). Prior to joining Pennsylvania
State University, he was with Electronics and Telecommunications Research Institute (ETRI), Korea, since 1993. He worked on
development of 2G and 3G wireless cellular core network elements. His research interests include mobility management and signaling
for wireless cellular and routing and resource allocation for multi-radio multi-hop wireless cellular networks.
Kyounghwan Lee received the B.S. degree in Electrical and Electronics Engineering from University of Seoul, Seoul, Korea, in 2000, and the
M.S. degree in Information and Communication Engineering from Gwangju Institute of Science and Technology, Gwangju, Korea,
in 2002. He is currently a Ph.D candidate at the Electrical Engineering department at the Pennsylvania State University and
a research assistant at the Wireless Communications and Networking Laboratory (WCAN@PSU). His research interests include wireless
communication theory and relay networks. E-mail: kxl251@psu.edu
Aylin Yener received the B.S. degrees in Electrical and Electronics Engineering, and in Physics, from Bogazici University, Istanbul,
Turkey, in 1991, and the M.S. and Ph.D. degrees in Electrical and Computer Engineering from Rutgers University, NJ, in 1994
and 2000, respectively. During her Ph.D. studies, she was with Wireless Information Network Laboratory (WINLAB) in the Department
of Electrical and Computer Engineering at Rutgers University, NJ. Between fall 2000 and fall 2001, she was with the Electrical
Engineering and Computer Science Department at Lehigh University, PA, where she was a P.C. Rossin assistant professor. Currently,
she is with the Electrical Engineering department at the Pennsylvania State University, University Park, PA, as an assistant
professor. Dr. Yener is a recipient of the NSF CAREER award in 2003. She is an associate editor of the IEEE Transactions on
Wireless Communications. Dr. Yener’s research interests include performance enhancement of multiuser systems, wireless communication
theory and wireless networking.
Thomas F. La Porta received his B.S.E.E. and M.S.E.E. degrees from The Cooper Union, New York, NY, and his Ph.D. degree in Electrical Engineering
from Columbia University, New York, NY. He joined the Computer Science and Engineering Department at Penn State in 2002 as
a Full Professor. He is the Director of the Networking Research Center at Penn State. Prior to joining Penn State, Dr. La
Porta was with Bell Laboratories since 1986. He was the Director of the Mobile Networking Research Department in Bell Laboratories,
Lucent Technologies. He is an IEEE Fellow and Bell Labs Fellow. Dr. La Porta was the founding Editor-in-Chief of the IEEE
Transactions on Mobile Computing. He has published over 50 technical papers and holds 25 patents. 相似文献
3.
Hakkı Soy Özgür Özdemir Mehmet Bayrak Ridha Hamila Naofal Al-Dhahir 《AEUE-International Journal of Electronics and Communications》2013,67(11):910-925
In this study, we consider a single-hop wireless sensor network where both the sensor nodes and the controller node have multiple antennas. We focus on single beam opportunistic communication and propose a threshold-based medium access control (MAC) scheme for uplink packet transmission which exploits multiuser diversity gain without feedback in a decentralized manner. Packet transfer from sensor nodes to the controller node is initiated when the channel quality of any node exceeds the predefined threshold based on the effective signal-to-noise ratio (ESNR) measurements at the sensor nodes through linear combining techniques. The optimum threshold is determined to maximize the probability of successful packet transmission where only one sensor node transmits its packet in one time-slot. The proposed scheme trades the successful packet rate to increase the SNR of the successful packets assuming Rayleigh fading and collision-based reception model. Computer simulations confirm that proposed scheme has higher successful packet SNR compared to the simple time division multiple access (TDMA)-based MAC scheme with round-robin fashion. The use of multiple antennas at the sensor nodes can also improve the throughput of proposed scheme compared with our previous scheme without implementing the spatial diversity at the SNs. 相似文献
4.
We propose and analyze a multicast algorithm named Dynamic Agent-based Hierarchical Multicast (DAHM) for wireless mesh networks that supports user mobility and dynamic group membership. The objective of DAHM is to minimize the overall network cost incurred. DAHM dynamically selects multicast routers serving as multicast agents for integrated mobility and multicast service management, effectively combining backbone multicast routing and local unicast routing into an integrated algorithm. As the name suggests, DAHM employs a two-level hierarchical multicast structure. At the upper level is a backbone multicast tree consisting of mesh routers with multicast agents being the leaves. At the lower level, each multicast agent services those multicast group members within its service region. A multicast group member changes its multicast agent when it moves out of the service region of the current multicast agent. The optimal service region size of a multicast agent is a critical system parameter. We propose a model-based approach to dynamically determine the optimal service region size that achieves network cost minimization. Through a comparative performance study, we show that DAHM significantly outperforms two existing baseline multicast algorithms based on multicast tree structures with dynamic updates upon member movement and group membership changes. 相似文献
5.
We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN), under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement. Based on the investigation, we jointly consider the routing, relay selection and power allocation algorithm, and present a novel distributed cross-layer strategy using opportunistic relaying scheme for cooperative communication. The results show that under the same QoS requirement, the proposed cross-layer strategy performs better than other cross-layer cooperative communication algorithms in energy efficiency. We also investigated the impact of several parameters on the energy efficiency of the cooperative communication in WSNs, thus can be used to provide guidelines to decide when and how to apply cooperation for a given setup. 相似文献
6.
Advances in wireless communications and mobile computing have led to the emergence of group communications and applications
over wireless. In many of these group interactions, new members can join and current members can leave at any time, and existing
members must communicate securely to achieve application-specific missions or network-specific functionality. Since wireless
networks are resource-constrained, a key challenge is to provide secure and efficient group communication mechanisms that
satisfy application requirements while minimizing the communication cost. Instead of individual rekeying, i.e., performing
a rekey operation right after each join or leave request, periodic batch rekeying has been proposed to alleviate rekeying
overhead in resource-constrained wireless networks. In this paper, we propose an analytical model to address the issue of
how often batch rekeying should be performed. We propose threshold-based batch rekeying schemes and demonstrate that an optimal
rekey interval exists for each scheme. We further compare these schemes to identify the best scheme that can minimize the
communication cost of rekeying while satisfying application requirements when given a set of parameter values characterizing
the operational and environmental conditions of the system. In a highly dynamic wireless environment in which the system parameter
values change at runtime, our work may be used to adapt the rekeying interval accordingly. 相似文献
7.
Wireless sensor networks (WSN) are formed by network-enabled sensors spatially randomly distributed over an area. Because the number of nodes in the WSNs is usually large, channel reuse must be applied, keeping co-channel nodes sufficiently separated geographically to achieve
satisfactory SIR level. The most efficient channel reuse configuration for WSN has been determined and the worst-interference scenario has been identified. For this channel reuse pattern and worst-case
scenario, the minimum co-channel separation distance consistent with an SIR level constraint is derived. Our results show that the two-hop co-channel separations often assumed for sensor and ad hoc
networks are not sufficient to guarantee communications. Minimum co-channel separation curves given various parameters are
also presented. The results in this paper provide theoretical basis for channel spatial reuse and medium access control for
WSN s and also serve as a guideline for how channel assignment algorithms should allocate channels. Furthermore, because the
derived co-channel separation is a function of the sensor transmission radius, it also provides a connection between network
data transport capacity planning and network topology control which is administered by varying transmission powers.
Xiaofei Wang is born on July 31st, 1974, in Jilin, People’s Republic of China. He received the M.S. degree in Electrical Engineering from
Delft University of Technology, Delft, The Netherlands in 1992, and the Ph.D. degree in Electrical and Computer Engineering
from Cornell University, Ithaca, New York in 2005.
From 1997 to 1998, he was selected as one of the twenty best master graduate candidates in all fields to participate in the
Japan Prizewinners Programme, an international leadership exchange program established by the Dutch Ministry of Culture, Science
and Education. From 1998 to 1999, he worked as a researcher at the Department of Electrical Engineering and Applied Mathematics
of Delft University of Technology in the areas of Secondary Surveillance Radar and Ground Penetrating Radar.
His research interests include wireless sensor networks, wireless mesh networks, wireless networking, error control coding,
communication theory and information theory. He is currently working at Qualcomm Incorporated in San Diego, CA.
Toby Berger was born in New York, NY on September 4, 1940. He received the B.E. degree in electrical engineering from Yale University,
New Haven, CT in 1962, and the M.S. and Ph.D. degrees in applied mathematics from Harvard University, Cambridge, MA in 1964
and 1966, respectively.
From 1962 to 1968 he was a Senior Scientist at Raytheon Company, Wayland, MA. From 1968 through 2005 he he held the position
of Irwin and Joan Jacobs Professor of Engineering at Cornell University, Ithaca, NY where in 2006 he became a professor in
the ECE Deportment of the University of Virginia, Charlottesville, VA.
Professor Berger’s research interests include information theory, random fields, communication networks, wireless communications,
video compression, voice and signature compression and verification, neuroinformation theory, quantum information theory,
and coherent signal processing.
Berger has served as editor-in-chief of the IEEE Transactions on Information Theory and as president of the IEEE Information
Theory Group. He has been a Fellow of the Guggenheim Foundation, the Japan Society for Promotion of Science, the Ministry
of Education of the People’s Republic of China and the Fulbright Foundation. In 1982 he received the Frederick E. Terman Award
of the American Society for Engineering Education, he received the 2002 Shannon Award from the IEEE Information Theory Society
and has been designated the recipient of the IEEE 2006 Leon K. Kirchmayer Graduate Teaching Award. Berger is a Fellow and
Life Member of the IEEE, a life member of Tau Beta Pi, and an avid blues harmonica player. 相似文献
8.
A common communications convergence scenario which is being adopted in personal communications relates to the combination
of wireless and cellular networks by the use of multimode terminals. Since most of the wireless networks were initially dimensioned
only for data communications, this paper shows how voice over wireless LAN dimensioning could be addressed under the optimal
network throughput and the perspective of voice quality, using a simple approach. The maximum number of simultaneous users
resulting from throughput is limited by the collisions taking place in the shared medium with the statistical contention protocol.
The voice quality is conditioned by the delay and the packet loss in the contention protocol. Both approaches are analyzed
within the scope of the voice codecs commonly used in voice over wireless LANs, to conclude that voice dimensioning based
on network throughput and voice quality show complementary results. Additionally the use of low rate codecs in voice over
wireless LANs is advantageous for the network performance point of view but may produce poor voice quality results. Mid range
codecs like G729 could represent a trade-off for quality throughput. For these reasons, voice quality and wireless network
throughput have to be taken into account in the network admission control, design and deployment to ensure a satisfactory
user experience. The impact of handoff interval of wireless convergent networks on the conversation quality need also be assessed
for a proper network design. 相似文献
9.
The convergence of heterogeneous wireless access technologies has been envisioned to characterize the next generation wireless
networks. In such converged systems, the seamless and efficient handoff between different access technologies (vertical handoff)
is essential and remains a challenging problem. The heterogeneous co-existence of access technologies with largely different
characteristics results in handoff asymmetry that differs from the traditional intra-network handoff (horizontal handoff)
problem. In the case where one network is preferred, the vertical handoff decision should be carefully executed, based on
the wireless channel state, network layer characteristics, as well as application requirements. In this paper, we study the
performance of vertical handoff using the integration of 3G cellular and wireless local area networks as an example. In particular,
we investigate the effect of an application-based signal strength threshold on an adaptive preferred-network lifetime-based
handoff strategy, in terms of the signalling load, available bandwidth, and packet delay for an inter-network roaming mobile.
We present an analytical framework to evaluate the converged system performance, which is validated by computer simulation.
We show how the proposed analytical model can be used to provide design guidelines for the optimization of vertical handoff
in the next generation integrated wireless networks.
This article is the extended version of a paper presented in IFIP Networking 2005
Ahmed H. Zahran is a Ph.D. candidate at the Department of Electrical and Computer Engineering, University of Toronto. He received both his
M.Sc. and B.Sc. in Electrical Engineering from Electronics and Electrical Communication Department in the Faculty of Engineering,
Cairo University in 2002 and 2000 respectively, where he was holding teaching and research positions. Since September 2003,
he has been working as a research assistant in the Department of Electrical and Computer Engineering, University of Toronto
under the supervision of Professor Ben Liang. His research interest is wireless communication and networking with an emphasis
on the design and analysis of networking protocols and algorithms.
Ben Liang received honors simultaneous B.Sc. (valedictorian) and M.Sc. degrees in Electrical Engineering from Polytechnic University
in Brooklyn, New York, in 1997 and the PhD degree in Electrical Engineering with Computer Science minor from Cornell University
in Ithaca, New York, in 2001. In the 2001–2002 academic year, he was a visiting lecturer and post-doctoral research associate
at Cornell University. He joined the Department of Electrical and Computer Engineering at the University of Toronto as an
Assistant Professor in 2002. His current research interests are in the areas of mobile networking and wireless multimedia
systems. He is a member of Tau Beta Pi, IEEE, and ACM and serves on the organization and technical program committees of a
number of major conferences each year.
Aladdin Saleh earned his Ph.D. degree in Electrical Engineering from London University, England. Since March 1998, Dr. Saleh has been working
in the Wireless Technology Department of Bell Canada, the largest service provider of wireless, wire-line, and Internet in
Canada. He worked as a senior application architect in the wireless data group working on several projects among them the
wireless application protocol (WAP) and the location-based services. Later, he led the work on several key projects in the
broadband wireless network access planning group including planning of the IEEE 802.16/ Wimax, the IEEE 802.11/ WiFi, and
the integration of these technologies with the 3G cellular network including Mobile IP (MIP) deployment. Dr. Saleh also holds
the position of Adjunct Full Professor at the Department of Electrical and Computer Engineering of Waterloo University, Canada
since January 2004. He is currently conducting several joint research projects with the University of Waterloo and the University
of Toronto on IEEE 802.16-Wimax, MIMO technology, interworking of IEEE 802.11 WLAN and 3G cellular networks, and next generation
wireless networks. Prior to joining Bell Canada, Dr. Saleh worked as a faculty member at different universities and was Dean
and Chairman of Department for several years. Dr. Saleh is a Fellow of IEE and a Senior Member of IEEE. 相似文献
10.
Energy consumption has been the focus of many studies on Wireless Sensor Networks (WSN). It is well recognized that energy is a strictly limited resource in WSNs. This limitation constrains the operation of the sensor nodes and somehow compromises the long term network performance as well as network activities. Indeed, the purpose of all application scenarios is to have sensor nodes deployed, unattended, for several months or years.This paper presents the lifetime maximization problem in “many-to-one” and “mostly-off” wireless sensor networks. In such network pattern, all sensor nodes generate and send packets to a single sink via multi-hop transmissions. We noticed, in our previous experimental studies, that since the entire sensor data has to be forwarded to a base station via multi-hop routing, the traffic pattern is highly non-uniform, putting a high burden on the sensor nodes close to the base station.In this paper, we propose some strategies that balance the energy consumption of these nodes and ensure maximum network lifetime by balancing the traffic load as equally as possible. First, we formalize the network lifetime maximization problem then we derive an optimal load balancing solution. Subsequently, we propose a heuristic to approximate the optimal solution and we compare both optimal and heuristic solutions with most common strategies such as shortest-path and equiproportional routing. We conclude that through the results of this work, combining load balancing with transmission power control outperforms the traditional routing schemes in terms of network lifetime maximization. 相似文献
11.
Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match
the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow
throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments.
We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs
packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection
by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling
algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow.
Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA
mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile
stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS
(D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property
of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link
conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also
shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile
stations, the overall throughput is not degraded as the number of mobile stations increases.
This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research
Laboratory project of Ministry of Science and Technology, 2004, Korea. 相似文献
12.
该文提出了无线移动多媒体通信网中基于宽带呼叫业务和窄带呼叫业务的双向层间切换业务模型(BLHM)和单向层间切换业务模型(SLHM),分别研究了两种业务在模型中的新呼叫阻塞概率和切换呼叫失败概率,对由于层间切换机制带来的呼叫业务质量(QoS)下降的宽带切换呼叫进行了定量分析。另外,该文还提出了基于呼叫业务代价函数和呼叫业务QoS的信道分配算法。最后进行了计算机仿真,将两种模型的性能进行了比较。 相似文献
13.
Salam A. Zummo 《Wireless Communications and Mobile Computing》2007,7(4):473-481
Diversity is an effective technique in enhancing the link quality and increasing network capacity. When multiple antennas cannot be used in mobile units, user cooperation can be employed to provide transmit diversity. In this paper, we analyze the error performance of coded cooperation diversity with multiple cooperating users. We derive the end‐to‐end bit error probability of coded cooperation (averaged over all cooperation scenarios). We consider different fading distributions for the interuser channels. Furthermore, we consider the case of two cooperating users with correlated uplink channels. Results show that more cooperating users should be allowed under good interuser channel conditions, while it suffices to have two cooperating users in adverse interuser conditions. Furthermore, under bad interuser conditions, more cooperating users can be accommodated as the fading distribution becomes more random. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
14.
Olli Lehtoranta Jukka Suhonen Marko Hnnikinen Ville Lappalainen Timo D. Hmlinen 《Signal Processing: Image Communication》2003,18(10):861-877
An experimental comparison of video protection methods targeted for wireless networks is presented. Basic methods are the data partitioning, reversible variable length coding, and macroblock row interleaving as well as macroblock scattering for packet loss protection. An implementation is described, in which scalable video is protected unequally with forward error correcting codes and retransmissions. Comparisons are performed for simulated wideband code division multiple access channel, and measurements are carried out with wireless local area network, Bluetooth as well as with GSM high speed circuit switched data. For the measurements, point-to-point connections are used. The achieved video quality is examined in our real-time wireless video demonstrator. The performance is measured with peak-signal-to-noise-ratio of received video, data overhead, communication delay, number of lost video frames, and decoding frame rate. Results show that the quality of decoded video can be improved by 1 dB with transparent connections compared to connections designed for general packet data. As a conclusion, a video coding subsystem must have access to the error control in a wireless link for the best quality in varying conditions. 相似文献
15.
Greedy geographic routing is attractive for large multi-hop wireless networks because of its simple and distributed operation. However, it may easily result in dead ends or hotspots when routing in a network with obstacles (regions without sufficient connectivity to forward messages). In this paper, we propose a distributed routing algorithm that combines greedy geographic routing with two non-Euclidian distance metrics, chosen so as to provide load balanced routing around obstacles and hotspots. The first metric, Local Shortest Path, is used to achieve high probability of progress, while the second metric, Weighted Distance Gain, is used to select a desirable node among those that provide progress. The proposed Load Balanced Local Shortest Path (LBLSP) routing algorithm provides loop freedom, guarantees delivery when a path exists, is able to efficiently route around obstacles, and provides good load balancing. 相似文献
16.
It has been shown that TCP and TCP-like congestion control are highly problematic in wireless multihop networks. In this paper we present a novel hop-by-hop congestion control protocol that has been tailored to the specific properties of the shared medium. In the proposed scheme, backpressure towards the source node is established implicitly, by passively observing the medium. A lightweight error detection and correction mechanism guarantees a fast reaction to changing medium conditions and low overhead. Our approach is equally applicable to TCP- and UDP-like data streams. We demonstrate the performance of our approach by an in-depth simulation study. These findings are underlined by testbed results obtained using an implementation of our protocol on real hardware. 相似文献
17.
Stefano Basagni Alessio Carosi Emanuel Melachrinoudis Chiara Petrioli Z. Maria Wang 《Wireless Networks》2008,14(6):831-858
This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their
lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs
that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show
that by controlling the sink movements we can obtain remarkable lifetime improvements. In order to determine sink movements,
we first define a Mixed Integer Linear Programming (MILP) analytical model whose solution determines those sink routes that
maximize network lifetime. Our contribution expands further by defining the first heuristics for controlled sink movements
that are fully distributed and localized. Our Greedy Maximum Residual Energy (GMRE) heuristic moves the sink from its current location to a new site as if drawn toward the area where nodes have the
highest residual energy. We also introduce a simple distributed mobility scheme (Random Movement or RM) according to which the sink moves uncontrolled and randomly throughout the network. The different mobility schemes
are compared through extensive ns2-based simulations in networks with different nodes deployment, data routing protocols,
and constraints on the sink movements. In all considered scenarios, we observe that moving the sink always increases network
lifetime. In particular, our experiments show that controlling the mobility of the sink leads to remarkable improvements,
which are as high as sixfold compared to having the sink statically (and optimally) placed, and as high as twofold compared
to uncontrolled mobility.
Stefano Basagni holds a Ph.D. in electrical engineering from the University of Texas at Dallas (December 2001) and a Ph.D. in computer science
from the University of Milano, Italy (May 1998). He received his B.Sc. degree in computer science from the University of Pisa,
Italy, in 1991. Since Winter 2002 he is on faculty at the Department of Electrical and Computer Engineering at Northeastern
University, in Boston, MA. From August 2000 to January 2002 he was professor of computer science at the Department of Computer
Science of the Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas.
Dr. Basagni’s current research interests concern research and implementation aspects of mobile networks and wireless communications
systems, Bluetooth and sensor networking, definition and performance evaluation of network protocols and theoretical and practical
aspects of distributed algorithms.
Dr. Basagni has published over four dozens of referred technical papers and book chapters. He is also co-editor of two books.
Dr. Basagni served as a guest editor of the special issue of the Journal on Special Topics in Mobile Networking and Applications
(MONET) on Multipoint Communication in Wireless Mobile Networks, of the special issue on mobile ad hoc networks of the Wiley’s
Interscience’s Wireless Communications & Mobile Networks journal, and of the Elsevier’s journal Algorithmica on algorithmic
aspects of mobile computing and communications.
Dr. Basagni serves as a member of the editorial board and of the technical program committee of ACM and IEEE journals and
international conferences. He is a senior member of the ACM (including the ACM SIGMOBILE), senior member of the IEEE (Computer
and Communication societies), and member of ASEE (American Society for Engineering Education).
Alessio Carosi received the M.S. degree “summa cum laude” in Computer Science in 2004 from Rome University “La Sapienza.” He is currently
a Ph.D. candidate in Computer Science at Rome University “La Sapienza.” His research interests include protocols for ad hoc
and sensor networks, underwater systems and delay tolerant networking.
Emanuel Melachrinoudis received the Ph.D. degree in industrial engineering and operations research from the University of Massachusetts, Amherst,
MA. He is currently the Director of Industrial Engineering and Associate Chairman of the Department of Mechanical and Industrial
Engineering at Northeastern University, Boston, MA. His research interests are in the areas of network optimization and multiple
criteria optimization with applications to telecommunication networks, distribution networks, location and routing. He is
a member of the Editorial Board of the International Journal of Operational Research. He has published in journals such as
Management Science, Transportation Science, Networks, European Journal of Operational Research, Naval Research Logistics and
IIE Transactions.
Chiara Petrioli received the Laurea degree “summa cum laude” in computer science in 1993, and the Ph.D. degree in computer engineering in
1998, both from Rome University “La Sapienza,” Italy. She is currently Associate Professor with the Computer Science Department
at Rome University “La Sapienza.” Her current work focuses on ad hoc and sensor networks, Delay Tolerant Networks, Personal
Area Networks, Energy-conserving protocols, QoS in IP networks and Content Delivery Networks where she contributed around
sixty papers published in prominent international journals and conferences. Prior to Rome University she was research associate
at Politecnico di Milano and was working with the Italian Space agency (ASI) and Alenia Spazio. Dr. Petrioli was guest editor
of the special issue on “Energy-conserving protocols in wireless Networks” of the ACM/Kluwer Journal on Special Topics in
Mobile Networking and Applications (ACM MONET) and is associate editor of IEEE Transactions on Vehicular Technology, the ACM/Kluwer
Wireless Networks journal, the Wiley InterScience Wireless Communications & Mobile Computing journal and the Elsevier Ad Hoc
Networks journal. She has served in the organizing committee and technical program committee of several leading conferences
in the area of networking and mobile computing including ACM Mobicom, ACM Mobihoc, IEEE ICC,IEEE Globecom. She is member of
the steering committee of ACM Sensys and of the international conference on Mobile and Ubiquitous Systems: Networking and
Services (Mobiquitous) and serves as member of the ACM SIGMOBILE executive committee. Dr. Petrioli was a Fulbright scholar.
She is a senior member of IEEE and a member of ACM.
Z. Maria Wang received her Bachelor degree in Electrical Engineering with the highest honor from Beijing Institute of Light Industry in
China, her M.S. degree in Industrial Engineering/Operations Research from Dalhousie University, Canada and her Ph.D. in Industrial
Engineering/Operations Research from Northeastern University, Boston. She served as a R&D Analyst for General Dynamics. Currently
MS. Wang serves as an Optimization Analyst with Nomis Solutions, Inc. 相似文献
18.
In wireless sensor networks, efficiently disseminating data from a dynamic source to multiple mobile sinks is important for
the applications such as mobile target detection and tracking. The tree-based multicasting scheme can be used. However, because
of the short communication range of each sensor node and the frequent movement of sources and sinks, a sink may fail to receive
data due to broken paths, and the tree should be frequently reconfigured to reconnect sources and sinks. To address the problem,
we propose a dynamic proxy tree-based framework in this paper. A big challenge in implementing the framework is how to efficiently reconfigure the proxy tree as sources and sinks change. We model the problem as on-line constructing a minimum Steiner tree in an Euclidean plane, and
propose centralized schemes to solve it. Considering the strict energy constraints in wireless sensor networks, we further
propose two distributed on-line schemes, the shortest path-based (SP) scheme and the spanning range-based (SR) scheme. Extensive simulations are conducted to evaluate the schemes. The results show that the distributed schemes have similar
performance as the centralized ones, and among the distributed schemes, the SR scheme outperforms the SP scheme. 相似文献
19.
In recent years there has been a growing interest in opportunistic routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. In contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor’s transmissions can become candidates to forward the packets towards the destination.In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing. 相似文献
20.
The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. Numerous link-quality-based routing metrics have been proposed for choosing high-throughput routing paths in recent years. In this paper, we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly how the routing metrics for unicast routing should be adapted for high-throughput multicast routing. We propose a low-overhead adaptive online algorithm to incorporate link-quality metrics to a representative multicast routing protocol. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh-network testbed, using ODMRP as a representative multicast protocol.Our extensive simulation studies show that: (1) ODMRP equipped with any of the link-quality-based routing metrics can achieve higher throughput than the original ODMRP. In particular, under a tree topology, on average, ODMRP enhanced with link-quality routing metrics achieve up to 34% higher throughput than the original ODMRP under low multicast sending rate; (2) the improvement reduces to 21% under high multicast sending rate due to higher interference experienced by the data packets from the probe packets; (3) heavily penalizing lossy links is an effective way in the link-quality metric design to avoid low-throughput paths; and (4) the path redundancy from a mesh data dissemination topology in mesh-based multicast protocols provides another degree of robustness to link characteristics and reduces the additional throughput gain achieved by using link-quality-based routing metrics. Finally, our experiments on an eight-node testbed show that on average, ODMRP using SPP and PP achieves 14% and 17% higher throughput over ODMRP, respectively, validating the simulation results. 相似文献