Ijcn V3 I3

INTERNATIONAL JOURNAL OF COMPUTER NETWORKS (IJCN)
VOLUME 3, ISSUE 3, 2011 EDITED BY DR. NABEEL TAHIR
ISSN (Online): 1985-4129 International Journal of Computer Networks (IJCN) is published both in traditional paper form and in Internet. This journal is published at the website http://www.cscjournals.org, maintained by Computer Science Journals (CSC Journals), Malaysia.
IJCN Journal is a part of CSC Publishers Computer Science Journals http://www.cscjournals.org
INTERNATIONAL JOURNAL OF COMPUTER NETWORKS (IJCN)

Book: Volume 3, Issue 3, August 2011 Publishing Date: 31-08-2011 ISSN (Online): 1985-4129 This work is subjected to copyright. All rights are reserved whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illusions, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication of parts thereof is permitted only under the provision of the copyright law 1965, in its current version, and permission of use must always be obtained from CSC Publishers.
IJCN Journal is a part of CSC Publishers http://www.cscjournals.org IJCN Journal Published in Malaysia Typesetting: Camera-ready by author, data conversation by CSC Publishing Services CSC Journals, Malaysia
CSC Publishers, 2011
EDITORIAL PREFACE
The International Journal of Computer Networks (IJCN) is an effective medium to interchange high quality theoretical and applied research in the field of computer networks from theoretical research to application development. This is the third issue of volume second of IJCN. The Journal is published bi-monthly, with papers being peer reviewed to high international standards. IJCN emphasizes on efficient and effective image technologies, and provides a central for a deeper understanding in the discipline by encouraging the quantitative comparison and performance evaluation of the emerging components of computer networks. Some of the important topics are ad-hoc wireless networks, congestion and flow control, cooperative networks, delay tolerant networks, mobile satellite networks, multicast and broadcast networks, multimedia networks, network architectures and protocols etc. The initial efforts helped to shape the editorial policy and to sharpen the focus of the journal. Starting with volume 3, 2011, IJCN appears in more focused issues. Besides normal publications, IJCN intend to organized special issues on more focused topics. Each special issue will have a designated editor (editors) either member of the editorial board or another recognized specialist in the respective field. IJCN give an opportunity to scientists, researchers, engineers and vendors to share the ideas, identify problems, investigate relevant issues, share common interests, explore new approaches, and initiate possible collaborative research and system development. This journal is helpful for the researchers and R&D engineers, scientists all those persons who are involve in computer networks in any shape. Highly professional scholars give their efforts, valuable time, expertise and motivation to IJCN as Editorial board members. All submissions are evaluated by the International Editorial Board. The International Editorial Board ensures that significant developments in computer networks from around the world are reflected in the IJCN publications. IJCN editors understand that how much it is important for authors and researchers to have their work published with a minimum delay after submission of their papers. They also strongly believe that the direct communication between the editors and authors are important for the welfare, quality and wellbeing of the journal and its readers. Therefore, all activities from paper submission to paper publication are controlled through electronic systems that include electronic submission, editorial panel and review system that ensures rapid decision with least delays in the publication processes. To build its international reputation, we are disseminating the publication information through Google Books, Google Scholar, Directory of Open Access Journals (DOAJ), Open J Gate, ScientificCommons, Docstoc and many more. Our International Editors are working on establishing ISI listing and a good impact factor for IJCN. We would like to remind you that the success of our journal depends directly on the number of quality articles submitted for review. Accordingly, we would like to request your participation by submitting quality manuscripts for review and encouraging your colleagues to submit quality manuscripts for review. One of the great benefits we can provide to our prospective authors is the mentoring nature of our review process. IJCN provides authors with high quality, helpful reviews that are shaped to assist authors in improving their manuscripts. Editorial Board Members International Journal of Computer Networks (IJCN)
EDITORIAL BOARD
EDITOR-in-CHIEF (EiC) Dr. Min Song Old Dominion University (United States of America)
ASSOCIATE EDITORS (AEiCs) Dr. Qun Li The College of William and Mary United States of America Dr. Sachin Shetty Tennessee State University United States of America Dr. Liran Ma Michigan Technological University United States of America
[
Dr. Benyuan Liu University of Massachusetts Lowell United States of America EDITORIAL BOARD MEMBERS (EBMs) Dr. Wei Cheng George Washington University United States of America Dr. Yu Cai Michigan Technological University United States of America Dr. Ravi Prakash Ramachandran Rowan University United States of America Dr. Bin Wu University of Waterloo Canada Dr. Jian Ren Michigan State University United States of America Dr. Guangming Song Southeast University China
Dr. Jiang Li Howard University China Dr. Baek-Young Choi University of Missouri Kansas City United States of America Dr. Fang Liu University of Texas at Pan American United States of America Dr. Enyue Lu Salisbury University United States of America Dr. Chunsheng Xin Norfolk State University United States of America Dr Imad Jawhar United Arab Emirates University United Arab Emirates Dr Yong Cui Tsinghua University China Dr Zhong Zhou University of Connecticut United States of America Associate Professor Cunqing Hua Zhejiang University China Dr Manish Wadhwa South University United States of America Associate Professor Vijay Devabhaktuni University of Toledo United States of America Dr Mukaddim Pathan CSIRO-Commonwealth Scientific and Industrial Research Organization Australia Dr Bo Yang Shanghai Jiao Tong University China
TABLE OF CONTENTS
Volume 3, Issue 3, August 2011
Pages
159 - 166 GPS Enabled Energy Efficient Rotung For Manet Divya Sharma, Ashwani Kush 167 - 177 ETFRC: Enhanced TFRC for Media Traffic Over Internet Mohammad A. Talaat, Magdi A. Koutb, Hoda S. Sorour 178 - 195 Effective Streaming of Clustered Data in Harsh Environment Y. Morgan, Y. Kunz, M. EI-Gindy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011
Divya Sharma & Ashwani Kush
GPS Enabled Energy Efficient Routing for Manet

Divya Sharma
Assistant Professor/CSE n IT Department ITM University Gurgaon-122017, India
divya84kkr@gmail.com
Ashwani Kush
Assistant Professor/CSE Department/University College Kurukshetra University Kurukshetra, 132119, India
akush20@gmail.com
Abstract
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network. Keywords: Ad Hoc Networks, AODV, Cross Layer Interaction, GPS.
1. INTRODUCTION
Ad Hoc Networks consist of mobile nodes that self configure to form a network without established infrastructure [7].Due to node mobility, network topology changes unpredictably, due to this host needs to determine the routes together nodes frequently. Ad-hoc On-Demand Distance Vector routing protocol proposed in [8] is one of the developed protocols that enable routing with continuously changing topologies. AODV establishes routes on demand basis. There have been several studies on AODV protocol and other on demand ad hoc routing protocols ([9], [10]). However, these schemes do not consider on-demand routing for mobile ad hoc networks. Different energy aware routing protocols use traditional protocols like AODV and DSR as base protocols. The selection of base protocol assumes importance for any kind of energy related proposal as the energy consumption pattern depends on this choice. One distinguish feature of power aware ad hoc routing protocol is its use of power status for each route entry. Given the choice between two routes to a destination, a requesting node is required to select one with better power status and more active. Scalability of Ad Hoc Network can be improved by utilizing geographical information such as in GFG[13], LAR[14],GPSR[15].They use physical location information, typically from GPS(Global Positioning System).GPS enables a device to determine their position as in longitude, Latitude and Altitude by getting this information from the satellites. There has been significant effort in proposing energy efficient routing protocols, with a more recent effort on cross layer design solutions ([11, 12]).In this paper, a novel routing with better power feature using information of the nodes has been proposed and cross layer interaction is also exploited. The rest of the paper is organized as follows. Section 2 illustrates the power related issues of routing protocols in MANET. Section 3 emphasis the problems faced in the current existing protocols. New Protocols description and system methodology is presented in section 4.Conclusions are given in Section 5.
2. POWER RELATED ISSUES

The lack of a centralized authority complicates the problem of medium access control (MAC) in MANETs. The medium access regulation procedures have to be enforced in a distributed and hence collaborative, fashion by mobile nodes. In the shared broadcast medium transmission of packets from distinct mobile nodes are prone to collision. This contention based medium access
159
results in retransmissions and appreciable delays. The performance of the MAC scheme affects the routing protocol adversely and consequently the energy consumption for packet transmission and reception increases. On-demand routing consists of route discovery and route maintenance [16]. In route discovery, source uses flooding to find a route to its destination. The large number of packets generated by flooding consumes energy of nodes unnecessarily. The transit nodes, upon receiving a query, learn the path to the source and enter the route in their forwarding tables. The destination node responds using the path traversed by the query. Route maintenance is responsible for reacting to topological changes in the network, and its implementation differs from one algorithm to the other. On-demand protocols include the schemes like ad hoc on demand distance vector routing (AODV) [8] and dynamic source routing (DSR) [17]. In these protocols, route discovery and maintenance may become inefficient under heavy network load since intermediate nodes will have a higher probability of moving due to the delay in packet transmissions attributed to MAC contention. Routes have a higher probability of breaking as a result of mobility. The rediscovery or repair of routes wastes battery power. The flooding of route request and route reply packets in on-demand routing protocols may result in considerable energy drain. Every station that hears the route request broadcasts will consume an amount of energy proportional to the size of the broadcast packet. In addition, stations that hear a corrupted version of a broadcast packet will still consume some amount of energy [18]. In a multi-hop ad hoc network, nodes must always be ready and willing to receive traffic from their neighbors. All the nodes unnecessarily consume power due to reception of the transmissions of their neighbors. This wastes an extensive amount of the total consumed energy throughout the lifetime of a node. Much work in this direction has been carried out by Chiasserini et al. [19], Jayashree S. et al. [20] etc. The design objectives require selecting energy-efficient routes and minimizing the control messaging in acquiring the route information. Efficient battery management [21, 22], transmission power management [23, 24] and system power management [25, 26] are the major means of increasing the life of a node. These management schemes deal in the management of energy resources by controlling the early depletion of the battery, adjust the transmission power to decide the proper power level of a node and incorporate low power consumption strategies into the protocols. Typical metrics used to evaluate ad hoc routing protocols are shortest hop, shortest delay and locality stability [27]. However, these metrics may have a negative effect in MANETs because they result in the over use of energy resources of a small set of nodes, decreasing nodes and network lifetime. The energy efficiency of a node is defined by the number of packets delivered by a node in a certain amount of energy. Three Layers are involved in communications as a) Physical layer For Link maintaince, transmission power should be at minimum level and it should also allow adapting to changes in transmission environment. Excessive transmission power can cause interference to other hosts. b) Data Link Layer By using effective retransmission request schemes and sleep mode operation, energy conservation can be achieved. It is important to appropriately determine when and at what power level a mobile host should attempt retransmission. Nodes transceiver should be powered off when not in use. c) Network Layer In ad hoc network it is important that the routing algorithm should be selected on the basis of best path from the viewpoint of power constraints as part of route stability. Routing algorithm can evenly distribute packet-relaying loads to each node to prevent nodes from being overused. Three extensions to the traditional AODV protocol, named Local Energy Aware Routing (LEAR-
160
AODV), Power Aware Routing (PAR-AODV) and Lifetime Prediction Routing (LPR-AODV) have been proposed by Senouci et al. [28], for balanced energy consumption in MANETs.
3. RECENT WORK
In Much research has been done in GPS based routing. In [1], Network is divided into four quadrants and via GPS; position of each node is detected. Full flooding is used but due to shortest path routing, this can lead to blocked path and overhead and latency increases due to hello messages. In [2] extensive use of digital map database is done in order to make the routing decision effective. But shortest path is used in it due to which problem of route blockage can arise. Much work has been done using cross layer approach to detect link breakage. Cross layer design concern with the interaction among different network layers to integrate channel and network characteristics and hence, promises to improve overall performance. In [3], MAC Layer inefficiencies have been eliminated in terms of achieved throughput. Routing assisted approach was used in which a node which initiates the communication, multicast the bandwidth reservation message to high power nodes. This, in turn leads to shortest path routes and consequently to improve performance but overhead occurred and there is increase of end to end delay also. In [4], cross layer design is used to improve route discovery by rejecting unidirectional links and supports usage of bi-directional links at routing layer but this protocol suffered from poor packet delivery .In [5] , energy efficiency and bandwidth is increased by exploiting cross layer interaction. Directional antennas are also used which caused latency. The network layer can aid in the conservation of energy by reducing the power consumed for two main operations, namely, communication and computation. The communication power consumption is mainly due to transmission and reception of bits. Whenever a node remains active, it consumes power. Even when the node is not actively participating in communication, but is in the listening mode waiting for the packets, the battery keeps discharging. The computation power consumption refers to the power spent in calculations that take place in the nodes for routing and other decisions. In traditional routing algorithms, routes are constructed on the basis of shortest path but these protocols are not aware of the energy consumed for the path setup or maintenance. Shortest path algorithm may result in a quick depletion of the energy of nodes along the heavily used routes. In this paper, a routing scheme with better power feature using geographical information of the nodes has been proposed. Routing is established using GRA [6]. It has been assumed that each node will get its geographical position from GPS [29]. Each routing table consists of all neighboring node. In traditional AODV, basic routing mechanism is when a source node S wants to send packets to Destination node D, it will broadcast RREQ to its neighbor. Then each intermediate node forwards their RREQ and also they record reverse routes back to Source S. In this way, route is established but the link quality between nodes is very unpredictable. Link quality depends on the signal to Interference Ratio (SIR)[6] .when this SIR drops below the systems SIR threshold Value, link is broken and route which has this broken link is disabled. By setting this Threshold value optimally, the mobile hosts are protected from draining their energy by transmitting data over a poor link. In this paper, an effort has been made to use cross layer interaction to overcome this problem. The GPS technology has been used to find the position of mobile nodes in the network. The concept suggests that only those nodes whose energy is in active mode can take part in the network path. Link breakage is detected by physical layer. It has been shown in Fig. 1. If a node has SIR less than system Threshold value then information about this link breakage is given to network layer by the physical layer so that network layer will update the routing table. Here, transmission is unicast; an acknowledgement will be received if there is successful transmission. If an acknowledgement is not received then node will choose another neighboring node. In this way, any error in the routing table due to stale data wont adversely affect the performance of the protocol.
161
Signal Reception Physical Layer Signal Transmission Mac Layer
FIGURE 1: Information sharing in Cross Layer Design
4. PROPOSED ALGORITHM
The AODV has been extended in the route Construction Phase to accept the concept of GPS nodes and also Route tables have been modified to insert entry for Power factor. This scheme does not require any modification to the AODV's route request RREQ process. When a source wants to transmit data to a destination but does not have any route information, it searches a route by broadcasting the route request RREQ packet. Each RREQ packet has a unique identifier so that nodes can detect and drop duplicate packets if any. The destination node sends a route reply RREP via the selected route when it receives the first route request RREQ or subsequent RREQs that have traversed. Route is established. The change occurs when a link break Route Repair: When a link break in an active route occurs, the node upstream of that break may choose to repair the link locally. Here the proposed scheme makes changes. Node to participate in route selection must be in active state. It can keep on transmission till it is in Active state and cannot participate if it moves in to danger state. In this case to efficiently apply power function routines cannot be made to turn nodes not participating in route to sleep mode to conserve energy as it to use GPS system. A node can be in idle state but not in sleep mode. All nodes of the topology broadcast these entries after fixed intervals to all nodes and each node updates its routing table. To repair the link break, the node increments the sequence number for the destination and then broadcasts a REQ for that destination. Two major factors have been considered for repair description. One is battery status and other is threshold value set for SIR. In first case battery status has been evaluated and two ranges have been set which can be categorized as in Equation-1. If BS >30%,then it is Active State else it is in Danger mode. --- 1 Where Bs is battery status and Percentage factor is for fully charged or decaying. 100% is fully charged battery range. For practical purposes, the battery decay rate is approximately 6 hours for decay from 100% to 30%. The Signal to interference ratio has also been divided into two parametric evaluations based on Threshold value. Equation 2 generalizes the theory. If SIR > Tv means SIR is good and message is transmitted to neighbor node Else there may be link break. ---- 2 From these two parameters a new value called lifetime of a node is calculated as shown in equation 3. Lifetime= BS+SIR --- 3 This factor is transmitted as weight factor to all nodes to select best available path with maximum power. The entry is done in route table and transmitted along with hello packet. Thus, local repair attempts are often invisible to the originating node. The node initiating the repair waits for the discovery period to receive reply message in response to that request REQ. During local repair, data packets are buffered at local originator. The scheme has been described using Figures 2 and 3.
162
Packets are to be transferred from source S to Destination D. Nodes have been shown in different colors. Here, Blue nodes stand for Active State and Red nodes stand for Danger State. Position of each node is detected by GPS.
1 S 4 6 5
3 D 8 7
FIGURE 2: Link break between node 2 and node 3. Path selected originally using RREQ is shown as {S-1-2-3-D} .When a link break occurs as shown in figure 2. A new path is to be created. Here local repair scheme proposed is adopted. Weight factor is calculated, this factor is transmitted to all nodes. The normal selection would have been {2-6-3}, but as per proposed scheme, new path selected is {2-5-8-3} which is longer one. This is much stable path for rest of the transmission. Node 6 has not been included as it is already in danger state and can cause link failure again. The concept has been described in Figure -3.
1 S 4 6
2 5
3 D 8 7
FIGURE -3 : Local repair scheme
5. CONCLUSION
A new scheme has been proposed that works on a reactive approach and utilizes alternate paths by satisfying a set of energy and distance based threshold criteria. The scheme can be incorporated into any ad hoc on-demand routing protocol to reduce frequent route discoveries. Theoretical study indicates that the proposed scheme will behave better than the existing protocols. Efforts are on to simulate it using NS2. Modifications have been made in NS2 to accept GPS addresses. The scheme is still under progress and results are expected very soon. It is forecasted that the proposed scheme will provide robustness to mobility and will enhance protocol performance. The delay may increase as it requires more calculation initially for setting route and GPS may take some time initially. The proposed scheme selects the nodes based on their energy status, which may also help in solving the problem of asymmetric links. Precision of GPS will also be considered.
6. REFERENCES
[1] Hossein Ashtiani et.al,PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks. In Proceedings of the World Congress on Engineering, 2009, Vol 1.
163
[2]
Albert m.K.Cheng and Koushik Rajan,A Digital Map/GPS Based routing and Addressing Scheme for Wireless Ad-Hoc Networks. In Proceedings of IEEE. Intelligent Vehicle Symposium, 2003. Vasudev Shah and Srikanth Krishnamurhty, Handling Asymmetry in Power Heterogeneous Ad Hoc Networks: A Cross Layer Approach. In Proceedings of 25th IEEE International Conference on Distributed Computing Systems, 2005. B.Ramachandran and S.Shanmugavel,Performance Analysis of Cross Layer AODV for Heterogeously Powered Ad Hoc Networks.In Proceedings of the IEEE International Conference on Wireless and Optical Communications Networks, 2006.
[3]
[4]
[5] Nie Nie and Cristina Comaniciu ,Energy Efficient AODV routing in CDMA Ad Hoc Networks using Beamforming,EURASIP Journal on Wireless Communications and Networking, 2006. [6] Wu Youjun and Nie Jignan Performance Evaluation for Cross Layer AODV Protocol in CDMA based Ad Hoc Networks. In Proceeding of IEEE Communication Technology, 2006. C.E.Perkins, Ad Hoc Networking, Addison Wesley, 2001. Carles E.Perkins Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561, IETF Network Working Group, July 1998. T.Kulberg, Performance of the Ad Hoc On-Demand Distance Vector Routing Protocols, HUT T-110.551 Helsinki University of Technology Seminar on Internetworking Sjokulla, 2004-04-26/27. J.Borch, D.Maltz, D.Johnson, Y.Hu and J.Jetcheva,A Performance comparison of multi hop wireless Ad Hoc Networking Routing Protocols.In Proceedings of ACM Mobicomm, 1998. C.Comaniciu, H.V. Poor, QoS Provisioning for Wireless Ad Hoc Data Networks, 42nd IEEE Conference on Decision and Control. December 2003.
[7] [8]
[9]
[10]
[11]
[12] R.L.Cuz and A.Santham,Optimal routing link scheduling and power control in multi-hop wireless networks, Proc. IEEE Infocom, 2003. [13] Bose,P.Morin,P.Stomenovie,I. and Umutia,J., Routing with guaranteed delivery in ad hoc wireless networks, in Proceedings of 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications DialM 1999,Seattle,pp 48-55. Ko,Y.B. and Vaidya,N.H. Location-aided routing (LAR) in mobile ad hoc networks, in Proceedings of ACM/IEEE MOBICOM,1998. Karp,B. and Kung,H.T., GPSR: Greedy perimeter stateless routing for wireless networks, in Proceedings of ACM MobiCom`2000.
[14]
[15]
[16] Royer E. M. and Toh C. K. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks , IEEE Personal Communications, vol. 6, no. 2,1999, pp. 46-55.
164
[17]
Johnson D.B. and Maltz D.B. Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing, Kluwer Academic Publishers, vol. 353, 1996, pp. 153-181.
[18] Gupta Nishant and Das Samir R., Energy Aware On Demand Routing for Mobile Adhoc Networks. International Workshop on Distributed Computing, Mobile and Wireless Computing, LNCS, vol. 2571, 2002, pp. 164-173. [19] Chiasserini C.F. and Rao R.R. Improving Battery Performance by Using Traffic Shaping Techniques. IEEE Journal on Selected Areas of Communications, vol. 19, no. 7, 2001, pp. 1385-1394.
[20] Jayashree S., Manoj B.S. and Siva Ram Murthy C. Energy Management in Adhoc Wireless Netwroks: A Survey of Issues and Solutions. Technical Report, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India, March, 2003. [21] Chiasserini C. F., Chlamtac I., Monti P. and Nucci A. Energy Efficient Design of Wireless Adhoc Networks. Proceedings of Networking 2002, pp. 376- 386. [22] Adamou M. and Sarkar S.,A Framework for Optimal Battery Management for Wireless Nodes. Proceedings of IEEE INFOCOMP 2002, pp. 1783-1792. [23] Kawadia V. and Kumar P. R. Power Control and Clustering in Adhoc Networks. Proceedings of IEEE INFOCOM03, 2003, pp. 459-469. [24] Toh C. K. Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Adhoc Networks. IEEE Communications Magazine, vol. 39, no. 6, 2001, pp. 138147. [25] Zheng R. and Kravets R. On Demand Power Management for Adhoc Networks. Proceedings of IEEE INFOCOMP 2003, vol. 1, 2003, pp. 481-491. Singh S. and Raghavendra C. S. PAMAS Power Aware Multi-Access protocol with Signaling for Ad- Hoc Networks. ACM SIGCOMM, Computer Communication Review, 1998, pp. 5-26.
[26]
[27] Woo M., S. Singh and Raghavendra C. S. Power-Aware Routing in Mobile Adhoc Networks. Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking, 1998, pp. 181190. [28] Senouci S. M. and Naimi M. New Routing for Balanced Energy Consumption in Mobile Adhoc Networks. Proceedings of ACM International Workshop on Performance Evaluation of Wireless Adhoc, Sensor and Ubiquitous Networks, 2005, pp. 238-241. [29] A.Kush,Sunila Taneja and Divya Sharma.Ad Hoc Routing Using GPS enabled nodes. Proceedings of International Conference on Reliability, Infocom Technology and Optimization , 2010, pp 353-357.
Type Flag Hop count REQ ID DEST IP SRC IP Power Status GPS Node Address
165
Type Route Request Format Dest Count N Reserved Unreachable Destination IP Address GPS Neighbor Node , Power status
Route Repair Format
166
Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour
ETFRC: Enhanced TFRC for Media Traffic over Internet

Mohammad A. Talaat
Faculty of Electronic Engineering University of Menofiya Menouf, Egypt
moadly@tedata.net.eg
Magdi A. Koutb
magdykoutb@yahoo.com
Hoda S. Sorour
hodasorour@yahoo.com
Abstract The evident increase in media traffic over Internet is expected to worsen its congestion state. TCP-friendly rate control protocol TFRC is one of the most promising congestion control techniques developed so far. TFRC has been thoroughly tested in terms of being TCP-friendly, responsive, and fair. Yet, its impact on the visual quality and the peak signal-to- noise ratio PSNR of the media traffic traversing Internet is still questionable. In this paper we aimed to point out the enhancements required for TFRC that enables producing the maximum PSNR value for Internet media traffic. Firstly, we suspected the default value of n that represents the number of loss intervals used in calculating the loss event rate in the TFRC equation. This value is recommended to be set to 8 according to the latest RFC of TFRC. We investigated the effect of modifying the TFRC mechanism on the resulting PSNR of the transmitted video over Internet using TFRC via switching n across the values from 2 to 16. We investigated the effect of such variation over a simulated network environment to study its effect on the resulting PSNR for a number of arbitrary video sequences. Our simulations results showed that running TFRC with n=11 led to reaching the maximum PSNR values among all the examined values of n including its default value. Secondly, we tested the impact on the PSNR of another modification in the TFRC mechanism via switching both values of n and Nfb which is frequency of feedback messages sent by TFRC receiver to its sender every round-trip time RTT. The default value of Nfb is 1; hence we scanned every possible combination of n and Nfb ranging from 2 to 16, and from 1 to 4, respectively and recorded the produced PSNR. It was obvious that several other combinations of n and Nfb produced higher PSNR values other than their default values in the request for comment RFC of TFRC. We hereby suggest using an enhanced TFRC that we abbreviated as ETFRC which has the values of n and Nfb value set to 4 and 11 respectively as a replacement for the traditional TFRC to enable reaching higher PSNR for media traffic over Internet. Keywords: Congestion Control, TFRC, PSNR, Media Traffic.
1. INTRODUCTION
The percentage of media traffic traversing Internet has remarkably increased over the last decade. Applications pushing media traffic such as video on demand VoD, video conferencing, and various video streaming websites have been lately invading the cyber space. The best-effort existing IP infrastructure was not primarily designed to suffice the quality of service QoS requirements of such traffic. Both of the current UDP and TCP have drawbacks when used as the transport protocol for media traffic. TCP seems to break the delay constraints due to its
167
acknowledgments; meanwhile UDP shows aggressiveness in acquiring the available bandwidth to accomplish the streaming task. UDP leaves an unfair share for the co-existing TCP flows which leads to congestion status. During the periods of congestion; routers tend to discard legitimate packets traversing a certain bottleneck to be able to serve the aggressive media packets. Efforts have been made by researchers to control congestion; they tried to balance between allowing for QoS achievement and acting in a TCP-friendly manner at the same time. This was via building congestion control protocols that leave a fair share of bandwidth for the concurrent TCP flows traversing across the same bottleneck. Protocols designed for this purpose have been tested regarding compatibility with the TCP-friendliness concept defined in [1]. TFRC presented in [2] was one of the congestion control protocols that managed to achieve remarkable smoothness in the variations of its rate of transmission in addition to fulfilling the TCPfriendliness conditions. For this reason TFRC was the best current promising candidate for media streaming applications, where its smoothness helps in reducing the undesired jitter of the perceived video. TFRC has been extensively tested in terms of fairness, aggressiveness, and responsiveness as in [3] and in terms of user-perceived media quality on analytical basis in [4]. Testing the visual quality of the media traffic running over TFRC in terms of its produced PSNR was made in our previous work in [5] This paper aims to reach an enhanced version of TFRC named as ETFRC that manages to produce higher PSNR values than for media traffic over Internet. To achieve this goal a network simulation topology was built to stream a variety of arbitrary video sequences over TFRC. The n parameter that represents the number of loss intervals samples used in calculating the loss event rate in the TFRC equation was switched among different values aiming to determine its optimum value for the best visual quality of video sequences transmitted over TFRC. This quality is measured in terms of the produced RSNR values for the streamed videos. The optimal value for n was found to be eleven where the maximum PSNR values were observed. Another investigation was made through switching the values of both of n along with Nfb which is the frequency of feedback messages per RTT. We aimed to figure out the combination of n and Nfb that leads to producing the maximum PSNR values for the video sequences traversing Internet using TFRC. Hence, TFRC is suggested to enhance its mechanism to be ETFRC that uses n=11 and Nfb=4 instead of their default values used in traditional TFRC. The rest of this paper is organized as follows: Section II covers the TFRC literature and its modified versions tackling the media streaming task over the last decade. Section III explains the enhancement we proposed to TFRC mechanism to produce the proposed ETFRC for media traffic over Internet. Section IV explains our simulation environment, the tool-set used in simulations, the topology of the simulated network, the link parameters set, and the characteristics of the running video sequences. Section IV presents the simulations output focusing on the PSNR values for the tested TFRC in order to show that the enhancement introduced to reach our proposed ETFRC managed to produce the maximum PSNR values. Finally Section V concludes this work.
2. THE TFRC PROTOCOL

2.1 TCP Friendly Congestion Control The TCP friendly congestion control schemes lies into two main categories according to [1]: (i) single rate schemes and (ii) multi-rate schemes. Unicast applications tend to utilize the single rate protocols where all recipients receive data with the same rate. This feature limits the scalability of the protocol towards bandwidth variations that exist in the path to some recipients. Multi-rate protocols are more flexible and enable the allocation of different rates for different recipients which makes it more appropriate for the multicast applications.
168
Each of those two top categories can be sub-divided into other two sub-categories as follows: (i) rate-based schemes and (ii) window-based schemes. Some of the rate-based schemes apply the additive increase multiplicative decrease AIMD approach embedded in TCP. Other rate-based just tune their sending rate in accordance with a TCP model. In both cases the reliability feature of TCP is absent. Example protocols that lie in this category are RAP [6], LDA+ [7], and TFRC. TCP itself is a window-based protocol, yet some problems should be considered when applying this mechanism on multicast connections. Multicast TCP MTCP [8] is an example protocol of this multicast category that managed to deal with these problems. 2.2 TFRC Protocol TFRC is the evolution of TFRCP [9]. It was mainly developed for unicast communications but it can be adapted for multicast. Its sending rate is tuned according to the TCP complex equation (1).
Where the parameters are as follows: T: TCP throughput RTT: Round-trip time RTO: Retransmission time-out value S: Segment size P: Rate of packet loss b: Number of packets acknowledged by each ACK : Maximum congestion window size cwnd. TFRC uses its sophisticated mechanisms to gather the equation parameters. The average loss interval is the chosen method to fulfill the requirements of the loss rate estimation. The loss rate is measured utilizing the latest 8 loss intervals through tracking the number of packets between consecutive loss events. The default number of loss intervals n utilized is recommended to be set to 8 according to the TFRC latest RFC which has the number 5348. The average of a specified number of loss intervals is calculated using decaying weights so that old loss intervals contribution in this average is less. The loss rate is considered as the inverse of the average loss interval size. Some additional mechanisms are adopted to prevent TFRC from responding aggressively to single loss events, and to guarantee that the sending rate adapts quickly to the long intervals that are loss-free. RTT is measured by sending feedback time stamps to sender. TFRC goes through a slow-start phase directly after starting just like TCP in order to increase its rate to reach a fair share of bandwidth. The slow-start phase is ended by reporting a loss event. TFRC receiver updates the equation parameters and feeds them back to sender to adjust its rate every round-trip time RTT. Hence a feedback message is sent once per RTT which means that the default Nfb=1, leading to the recalculation of the sending rate for TFRC only once per RTT. TFRC adopts additional delay-based congestion avoidance by adjusting the inter-packet gap which would be applied in some environments that do not support the TCP complex equation. TFRC main advantage is its stable and smooth sending rate variations. This feature fits in the media application transmission besides being responsive to the co-existing traffic in a TCPfriendly manner.
169
2.3 TFRC Enhancement Attempts Several attempts were made to enhance the performance of TFRC in order to suit the media traffic requirements such as what discussed in the following lines: In [10] authors observed some performance degradation for TFRC over wireless networks, and hence they tried to customize it through a more advanced equation. This equation was reached via modeling wireless TCP rather than wired TCP. Applying this equation led to a remarkable throughput increase with about 30% over wireless networks with loss of 10% while maintaining the TFRC main features of TCP-friendliness and smoothness. In [11] an attempt was made to enhance TFRC performance over mobile and pervasive networks that focused on overcoming data losses due to the frequent loss of connectivity. The method used was applying a mechanism that resembles FreezeTCP when a disconnection incident is expected. Additionally, a probing mechanism to enable speedy adaptation to new network conditions was proposed. Another enhancement was made in [12] where authors tackled the problem of keeping fairness and smoothness of TFRC media streams when existing among other streams. They proposed MulTFRC that was successful in keeping low delay values to satisfy the media QoS requirements. In [13] the enhancement made was that authors computed the rate gap between the ideal TCP throughput and the smoothed TFRC throughput replacing it. Any rate gain from this gap was opportunistically exploited via video encoding. A frame complexity measure is specified to determine the additional rate to be used from this rate gap, and then the target rate for the encoder and the final sending rate are negotiated through the same frame of complexity. In [14] authors suggested incorporating the selective retransmission concept into TFRC. Retransmission of lost packets is done selectively when no congestion case is present. Selective retransmission was shown to have a significant positive effect on the streamed media quality over TFRC. In [15] authors claimed that TFRC does not perform satisfactorily on multi-hop ad-hoc wireless networks. They saw that TFRC sending rate can be deceived by MAC layer contention effects such as retransmission and exponential back-off. Hence, they proposed enhancing TFRC by introducing RE-TFRC. RE-TFRC used measurements of the current round-trip time and a model of wireless delay to prevent TFRC from overloading the MAC layer while keeping its TCPfriendliness feature. In [16] a performance analysis of a QoS-aware congestion control mechanism named guaranteed TFRC (gTFRC) was presented. gTFRC was embedded into the enhancement transport protocol (ETP) that enables protocol mechanisms to be dynamically controlled. gTFRC managed to reach a minimum guaranteed transfer rate for any given round-trip values and any network provisioning conditions as well In [17] an extension for TFRC was suggested in order to support variable packet size streams. Variable packet size is already utilized over Internet in both video and voice over IP VoIP transmission. This enhancement of TFRC was made through a modified concept of TCPfriendliness and was validated to perform better than the original TFRC with the packets of variable sizes. In [18] authors proposed an enhanced TFRC based on step explicit congestion notification ECN making. They found that TFRC has poor performance over wireless networks because it accounts for wireless losses as congestion. They managed to reach higher throughput via utilizing the appropriate loss differentiation and congestion notification.Their proposed enhanced
170
TFRC kept reasonable friendliness to the co-existing TCP flows according to their results. The above enhancement attempts focused on achieving a better quality of data transmitted over TFRC while maintaining its main advantageous characteristics of being TCP- friendly and fair in acquiring a bandwidth share.
3 ENHANCED TFRC ETFRC PROTOCOL

The enhancement that we introduced to TFRC to produce ETFRC was increasing the number of sample loss intervals n used to calculate the rate of packet loss P from n=8 to n=11 We also studied the effect of combining the different values of n along with other values of feedback frequency represented by Nfb parameter. The effect of varying the Nfb solely was studied in [19]. Our goal is to demonstrate through simulations that combining the values of n=11 and Nfb=4 leads to the maximum PSNR values for the transmitted video over TFRC. For the sake of completeness, other effects of such increase on the TFRC mechanism of work should be discussed. In [20] authors discussed the impact of increasing the feedback frequency from different perspectives that we summarize here: 3.1 The Impact of Increasing Nfb on TFRC Mechanism To have a better view for the background image of TFRC, we have to understand that there are two key parameters that drive the TFRC mechanism in Eq.1 which are the loss rate p and the experienced RTT. In our work we used the value of Nfb=1 as a reference value as this frequency is considered as the default of TFRC. Simulations made in [20] showed that feedback frequencies greater than one per RTT lead to lower drop rate. It was also clear that the feedback frequency is not correlated to P, where both values were randomly distributed. Hence, Nfb has no critical effect on P from the macroscopic perspective. The analysis made in [20] for TFRC demonstrated the impact of increasing the feedback frequency on RTT, it showed that during the slow-start of TFRC the link suffers from underutilization as well as slow convergence. For the first hundred seconds the value of RTT in TFRC equals to that of the link propagation delay, meanwhile after this period, TFRC enters the steady state where the increase in feedback frequencies causes the experienced RTT to increase. 3.2 The Impact of Increasing Nfb on Sending Rate Researches also noted that when the feedback frequency increases the rate of the senders tend to decrease, which seems to contradict with what was expected of decrease in network congestion and the decrease in RTT consequently. The higher feedback frequency was found to improve the accuracy of the estimated RTT and the accuracy of the estimated p in consequent. This enables TFRC to acquire the network resources with the minimum required sending rate due to the fact that the more accurate the sense of the network congestion parameter the faster the adaptation of TFRC to the network conditions. 3.3 The Impact of Increasing Nfb on Network Parameters Increasing the feedback frequency of TFRC from one to four had a positive impact on its responsiveness. However the resulting fairness depended on how lost packets were distributed among flows. The link utilization also followed the same behavior of increase like that of responsiveness when having multiple feedbacks per RTT
4 SIMULATIONS ENVIRONMENT
This section describes our simulation environment used to perform the PSNR evaluation of the media traffic over TFRC. The main three components of these simulations are the tool-set used, the topology of the simulated network created using ns-2.30 [21], and the group of video sequences arbitrarily chosen for this purpose. 4.1 Evalvid Tool-set and Evalvid-RA In [22] Chih-heng Ke et al. proposed a novel and complete tool-set for evaluating the quality of MPEG video delivery over simulated networks environment. This tool-set is based on the EvalVid
171
framework [23]. They managed to let ns-2 as a general network simulator replace the EvalVid simple error simulation model through extending its connecting interfaces. This allowed researchers and practitioners in general to simulate and analyze the performance of real video streams with consideration for the video semantics under a vast range of network scenarios. The tool-set valuable feature is that it allows for the examination of the relationship between two well-known objective metrics for QoS assessment of video quality of delivery which are the PSNR and the fraction of decodable frames. As shown in Fig. 1 the concept of this tool-set is built upon creating trace files from an encoded raw video. These files are text files and are fed into the simulation environment to be used as traffic generators based on the encoded video parameters. The output of the simulation process can be decoded as well to produce the output video file of the simulation. The quality of the output file and the original video file can then be compared to obtain a representative PSNR value for the media quality of the produced video from simulation
FIGURE 1: EvalVid Tool-set.
EvalVid-RA proposed in [24] is an extension of EvalVid tool-set that supports the rate adaptive media content as well as the TFRC protocol in the simulation environment, thus it was chosen to be used in this work. 4.2 The Simulations Network Topology Our simulation topology in this paper is the same simple topology used in [24]. As shown in Fig. 2, it is a simple dumbbell topology composed of four traffic sources and four traffic destinations. We used ns-2.30 as our network simulator to build this topology. Both S0 and S1 are fed with the simulated video trace files while S2 and S3 generate TCP traffic. The video traffic is shaped variable bit-rate traffic rate adaptive (RA-SVBR), and the bottleneck between the routers R0 and R1 is 40Mbit/s link with propagation delay of 10ms. The access network capacities were set to 32Mbit/s with 5ms delay producing a one-way propagation delay of 20ms. The fair share after starting all sources was over 625Kbit/s and both R0 and R1 routers used ordinary random early detection (RED).
172
Using ns-2.30 enabled testing TFRC with different Nfb values to find optimum value for ETFRC S0 RA-SVBR RA-SVBR D0
S1 D1 R0 TCP R1
S2
D2
TCP
S3
D3
FIGURE 2: Simulations Topology
4.3 The Video Sequences Used in Simulations Two video sequences used in our simulations as shown in Table 1. They are provided for research purposes by Arizona State University research group in [25]. (2)
Where k and MSE are as follows: k: the number of bits per pixel MSE: the mean square error of the luminance component. They were used in YUV format where they are firstly encoded using ffmpeg.exe and then passed by the mp4.exe which are both component files of the used tool-set. A brief description for each of the videos content is presented as follows: 1. Bridge-close: a close scene of Charles bridge 2. Mobile: panning of moving toys The following table shows the video sequences used and their number of frames and complexity of motion: Video Sequence
Bridge-close Mobile
No. of Frames
2001 300
Motion Complexity
Low Medium
TABLE 1: The Video Sequences Used in Simulations.
The final output of the tool-set is a text file that contains a table of two columns where the PSNR value of each compared video frame calculated according to equation (2) .is recorded in decibels (dB) corresponding to their frame numbers.
173
We utilized the mean PSNR value for each simulation video file for our evaluation purpose to be compared with the reference mean PSNR produced by TFRC having the default Nfb value of one. The resulting text files are then fed into the ns-2 simulation file where the output is concatenated through et_ra.exe tool and then decoded. The decoded file quality is the compared to the original file quality using the psnr.exe program as demonstrated in Fig. 1.
5 SIMULATIONS RESULTS
The goal of building and running the simulated environment explained above was to investigate the effect of switching the n and Nfb parameter over a range of values on the resulting PSNR values of the output files.
FIGURE 3: PSNR Values Vs n
The goal of building and running the simulated environment explained above was to investigate the effect of switching the n and Nfb parameter over a range of values on the resulting PSNR values of the output files. Our results are based on calculating the mean PSNR values for each video sequence which are the results of comparing the output video files of simulation over TFRC protocol and the original video files. Those PSNR values were calculated using the psnr.exe program as a part of the EvalVid tool-set. The program compares each output video file to the original file on frame-byframe basis. It produces a text file that contains a PSNR value for each of the video frames. The mean of those PSNR values were computed to be compared to those of the default PSNR values of the TFRC Knowing that the default value of n in TFRC is 8 and of Nfb in TFRC is 1, we managed to switch n over a range of values from 2 to 16 and Nfb over the values of 1, 2, 3, and 4. Our first finding was that the PSNR values of the output files all lie in the acceptable range at the chosen values of n and Nfb. This means that TFRC is a suitable candidate for running the media traffic from both points of views of TCP-friendliness and media quality maintenance. The output files were visually meaningful. They had a degraded quality with respect to the original video files, but all the files were considered to be visually acceptable by human eye as well as PSNR values. Our next goal in this paper was specifying the exact combination of values of both n and Nfb that produces the maximum PSNR for the output video files, and that would be set as the defaults in the suggested ETFRC. To achieve this goal we recorded the PSNR for each of the values chosen for n and Nfb. Fig. 3 represents the PSNR values of both simulated videos versus the range of values scanned for n while Fig. 4 represents the PSNR values of one of the videos versus all the possible combinations of n and Nfb over their scanned ranges for testing.
174
We can also note in Fig. 3 that n=11 leads to the maximum PSNR values among the other tested values. While in Fig. 4 we can notice that the combination of n=11 and Nfb=4 is the optimum for having maximum PSNR for the tested video. We believe that our simulation results are helpful for measuring the performance of the TFRC from a point of view that has not been thoroughly tackled before which is the PSNR of videos running over it.
FIGURE 4: PSNR Values Vs n and Nfb
6 CONCLUSION
The problem of Internet congestion control has been handled by researchers over the last decade. It was observed that the quantity of media traffic traversing the Internet has tremendously increased due to the increase in the number of emerging applications running such traffic which led to worsening the case of congestion. Several congestion control protocols have been developed to face the problem and also have been tested from the TCP-friendliness point of view and achieved promising performance in many cases, but the media traffic currently booming over Internet imposed some additional criteria on the congestion control protocols other than just being TCP-friendly and fair in bandwidth acquiring. These criteria focused on delivering the media traffic with an acceptable PSNR quality leading to a visually meaningful and acceptable traffic. TFRC according to researches is a good candidate protocol for this target. It can balance between accomplishing the TCP-friendliness task and allowing for some QoS constraints to be met. Several researches pointed out that TFRC with its current mechanism of work is not the ideal protocol for congestion handling, and hence many enhancement attempts were made to reach a more suitable form of it. A number of researches targeted the evaluation of TFRC in terms of TCP-friendliness and fairness and many tests were done for this purpose either in the simulated environments or in the real-world. TFRC has also been tested so far regarding the quality of the media traffic running over it. This work managed to find an enhanced version of TFRC named as ETFRC through changing the default values of both parameters n and Nfb in TFRC from eight to eleven and from one four respectively to form the ETFRC. This was by testing the quality of a group of videos when
175
transmitted over TFRC while switching the values of n and Nfb over a range of nominated integers. This testing utilized the simulation environment and was made in terms of the visual usefulness of the received video files. It was also made in terms of the mean PSNR values in dB of the output files of the simulation process when compared to the originally transmitted files. TFRC was shown to produce acceptable quality for the received video files. This emphasizes the fact that TFRC is still the candidate for the congestion control problem solving. It was also shown through the simulations results that the performance of TFRC in terms of quality was enhanced slightly with the above suggested changing in defaults We hereby propose the ETFRC protocol as an enhancement for TFRC where the number of sample loss intervals used is eleven instead of eight and the feedback frequency utilized value is four instead of one. We also believe that this work can be helpful for researchers handling the congestion control problem and researchers trying to enhance the performance of TFRC in order to increase its capabilities of being the congestion control problem solution.
7 REFERENCES
[1] J. Widmer, R. Denda, and M. Mauve, A survey on tcp-friendly congestion control (extended version), Technical Report, Department for Mathematics and Computer Science, University of Mannheim, Feb. 2001. S. Floyd, M. Handley, J. Padhye, and J. Widmer, Equation-based congestion control for unicast applications, in Proc. ACM SIGCOMM, Stockholm, Sweden, Aug. 2000, pp. 43 56. S. Tsao, Y. Lai, and Y. Lin, Taxonomy and Evaluation of TCP-Friendly Congestion Control Schemes on Fairness, Aggressiveness, and Responsiveness. IEEE Network, vol. 21, no. 6, 2007, pp. 6-15. Lisong Xu and Josh Helzer, Media Streaming via TFRC: an Analytical Study of the Impact of TFRC on User-perceived Media Quality, Computer Networks, vol. 51, no. 17, 2007, pp. 4744-4764. M. A. Talaat, M. A. Koutb, and H. S. Sorour, "PSNR Evaluation for Media Traffic over TFRC," International Journal of Computer Networks and Communications, vol. 1, no. 3, pp. 71-76, October 2009. R. Rejaie, M. Handley, and D. Estrin, Rap: An end-to-end rate-based congestion control mechanism for real-time streams in the internet, in Proc. IEEE Infocom, Mar. 1999. D. Sisalem and A. Wolisz, Lda+ tcp-friendly adaptation: A measurement and comparison study, in Proc. International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), June 2000. I. Rhee, N. Balaguru, and G. Rouskas, Mtcp: scalable tcp-like congestion control for reliable multicast, in Proc. of IEEE INFOCOM, March 1999, vol.3, pp. 1265-1273. J. Padhye, D. Kurose, and R. Towsley, A model based tcp-friendly rate control protocol, in Proc. International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), June 1999. B. Zhou, C. P. Fu, V. O. K. Li, "Tfrc veno: an enhancement of TCP-friendly rate control over wired/wireless networks,"in ProcIEEE ICNP, Oct. 2007.
[2]
[3]
[4]
[5]
[6] [7]
[8] [9]
[10]
176
[11]
O. Mehani and R. Boreli, "Adapting TFRC to mobile networks with frequent disconnections," in Proc. CoNEXT 2008, 4th ACM International Conference on emerging Networking EXperiments and Technologies, K. W. Ross and L. Tassiulas, Eds. New York, NY, USA: ACM, 2008. D. Darjanovic and Michael Welzl, Multfrc: providing weighted fairness for multimedia applications (and others too!). in Proc. ACM Computer Communication Review, 2009. E. Tan, J. Chen, S. Ardon, and E. Lochin, Video tfrc, IEEE International Conference on Communications, Beijing, China, 2008. A. Huszak and S. Imre, Tfrc-based selective retransmission for multimedia applications, in Proc. Advances in Mobile Multimedia, Jakarta, Indonesia, 2007, pp. 53-64. M. Li, C. Lee, E. Agu, M. Claypool, and R. Kinicki, Performance enhancement of TFRC in wireless ad-hoc networks, in Proc of. 10th International Conference on Distributed Multimedia Systems (DMS), California, USA, September 2004. G. Jourjon, E. Lochin, L. Dairaine, P. Senac, T. Moors, and A. Seneviratne, Implementation and performance analysis of a QoS-aware TFRC mechanism," in Proc. of IEEE ICON, Singapore, September 2006. P. G. Vasallo, Variable packet size equation-based congestion control, International Computer Science Institute ICSI, Technical Report, April, 2000. Zhuonong Xu, Jiawei Huang, and Jianxin Wang, Jin Ye, "An enhanced tfrc protocol based on step ecn marking," International Conference on Communications and Mobile Computing (CMC), Shenzen, China, April 2010. Mohammad A. Talaat, Magdi A. Koutb, and Hoda S. Sorour, Etfrc: enhanced tfrc for media traffic, International Journal of Computer Applications (IJCA), vol. 18, no. 6, pp. 1-8, March 2011. Dino M. Lopez-Pacheco, Emmanuel Lochin, Golam Sarwar, and Roksana Boreli, "Understanding the impact of tfrc feedbacks frequency over long delay links," Global Information Infrastructure Symposium (IEEE GIIS 2009), Hammamet, Tunisia, 2009. University of California Berkeley, http://www.isi.edu/nsnam/ns. The Network Simulator ns-2, [Online]
[12] [13] [14] [15]
[16]
[17] [18]
[19]
[20]
[21] [22]
C. H. Ke, C. K. Shieh, W. S. Hwang, A. Ziviani, An Evaluation Framework for More Realistic Simulations of MPEG Video Transmission, Journal of Information Science and Engineering, vol. 24, no. 2, pp.425-440, March 2008. J. Klaue, B. Rathke, and A. Wolisz, "Evalvid - A framework for video transmission and quality evaluation, in Proc. 13th International Conference on Modeling Techniques and Tools for Computer Performance Evaluation, pp. 255-272, Urbana, Illinois, USA, September 2003. A. Lie, and J. Klaue "Evalvid-RA: Trace Driven Simulation of Rate Adaptive MPEG-4 VBR Video", Multimedia Systems, vol. 14, no. 1, 13. November 2007. Arizona State University, http://trace.eas.asu.edu/yuv/index.html. YUV Video Sequences [Online]
[23]
[24] [25]
177
Y. Morgan, T. Kunz & M. El-Gindy
Effective Streaming of Clustered Sensor Data in Harsh Environment

Y. Morgan
Software Systems ngineering University of Regina Regina, SK, CANADA
yasser.morgan@uregina.ca
T. Kunz
Computer Systems ngineering Carleton University Ottawa, ON,CANADA
tkunz@sce.carleton.ca
M. El-Gindy
Automotive Engineering University of Ontario Institute of Technology Oshawa, ON, CANADA
moustafa.el-gindy@uoit.ca
Abstract A milestone of success for any sensor network establishment is successful data streaming over point-to-point communications (P2P). Typical P2P services would present the descriptive best-effort (BE) or other Quality of Service (QoS) streams. In this research, we present the Stateless Wireless Ad-hoc Network model (SWAN), an integrated model that is known to work in typical ad-hoc configurations like the classical wireless ad-hoc sensor networks. SWAN is a lightweight QoS model that enables operations over any routing protocol or Media Access Control (MAC) layers while exhibiting some advantages over competing models. Nevertheless, SWAN is vulnerable to troubles related to mobility and false admission. The SWAN model design relies on picking a candidate (victim) data flow to manipulate as a congestion control measure. We extend SWAN by adding the destination-based regulation and also show the reasons why the destination-based regulation chooses real-time data victim streams in an accurate mode. Thus, we propose the use of destination-based regulation to resolve the dynamic congestion issues. This confines SWANs pertinence for streaming scenarios such as the instance of essential continuous broadcast (CB-streaming). We consider it is possible to transport CB communications over substitute MAC layer such as the 802.11 or other wireless technology. To perform that, we introduce the purpose of SWAN in addition to the suggested enhanced destination based algorithm to transport the trusted CB-streaming applying P2P communications, but by rendering it with dissimilar QoS parameters. We believe that the SWAN approach in this regard is more in line with the nature of sensor networking with the awareness that sensors normally form and vanish quickly giving small opportunity to reconfigure or reposition the profiles of dynamically formed networks. Hence, sensing devices maintain low computational, storage capacities, processing, and battery life. Keywords: SWAN, P2P, Streaming
1.
INTRODUCTION
The recent advances in sensing and wireless technologies have facilitated the design of modern systems that have never been possible. A typical approach uses probe sensors to collect data from harsh industrial or natural environment where extreme pressures and temperatures reach levels prohibiting common data collection methods. Another example is collecting information from battlefield or from remote places like the arctic or even deep below ocean surface or volcanic site.
178
In all those scenarios, scientists are increasingly demanding the streaming of information where sensors are required to deal with mobility, low battery and periods of long inactivity. Yet sensor networks must maintain connectivity and lightweight management of it exceedingly limited resources. Precisely, the instinctive solvent would certainly be to transport data streams over pointto-point communications (P2P), which happens to be acquiring impulse as the milestone of success for any sensor network establishment. In an effort to transport data streams over P2P links, we require to back up more descriptive best-effort (BE) Quality of Service (QoS). In this research, we spread out an integrated model, which was acquainted to work on classical wireless ad-hoc sensor networks. SWAN is a lightweight conciliatory QoS model that enables operations over any routing protocol or Media Access Control (MAC) layers while rendering some vantages over competitor models. Nevertheless, SWAN is vulnerable to troubles related to mobility and false admission. The core facet of SWAN (and in fact any QoS model) is picking a candidate data flow to manipulate during which QoS warrantees are being transgressed. We broaden SWAN by showing the destination-based algorithm and also show the reasons why the destination-based algorithm chooses real time data victim streams in an accurate mode. And so we furnish trial run results to examine and obtain the destination-based method. QoS support in sensor networks is certainly a dynamic research subject. Acknowledging the belief that QoS frameworks as a way for the secured Internet will likely not be suitable for networks, by using highly active topologies, research workers featured several QoS results as a way for sensor networks. In the midst of various suggestions, SWAN has demonstrated high levels of robustness and power onto retrieve right from the contrary mobility states compared with FQMM, dQoS or INSIGNIA, as a result of its stateless design. SWAN could function over BE MAC which includes IEEE 802.11 Distributed Coordination Function (DCF), and habituates an integrated stateless distributed access to work out the active QoS disabilities. SWAN runs in a fully decentralized mode with the intention to straighten out the sensing dynamics. SWAN expends informant admission controller to confine the level of acknowledged real time flow rates. In response to environmental dynamics that leads over to periodic congestion, SWAN expends explicit congestion notification (ECN) to dynamically modulate real time traffic. Due to the fact that intermediate sensors will likely not preserve per-flow state data, resolving congestion scenarios turns a bit challenging. Yet, holding the tenet associated with a stateless model proceeds the system unproblematic, scalable, robust, and ironically lightweight. Besides, SWAN also conforms the technique of delicate real time service warrantees. Whenever a real time flow rate is acknowledged about the network applying admission control, it is potential over at any detail during the life time of the flow rate to be downgraded to best-effort/ to halt it in reception over to network dynamics. Each source sensor should re-initiate a novel admission procedure with the intension to re-establish the flow. This would be a knock down feature of SWAN due to the delicate real time guarantees, which acts as a conventional reception to self-healing feature the wireless sensor networks, may go through. Nevertheless, SWAN enforces no actual service distinction grounded on exploiter profiles. This confines SWANs pertinence for streaming scenarios such as the instance of essential continuous broadcast (CB-streaming). We consider it is possible to transport CB communications over substitute MAC layer such as the 802.11 or other wireless technology. To perform that, we introduce the purpose of SWAN in addition to the suggested enhanced destination based algorithm to transport the trusted CB-streaming applying P2P communications, but by rendering it with dissimilar QoS parameters. A number of us reckon that the SWAN approach in this regard is more in line with the nature of sensor networking with the sensation that sensors normally form and vanish quickly considering small opportunity to reconfigure or reposition the profiles of dynamically formed clusters. Hence, sensing devices maintain low computational, storage capacities, processing, and battery life. The dynamic shaping and diminishing of sensor sub-clusters is necessary to be handled and modulated dynamically, autonomously and seamlessly without user intervention. Regrettably, SWAN has disregarded the attribute of real time flowing delays as SWAN framework utilizes per-link delays simply to observe congestion, and uses bandwidth states to alleviate admission control. End-to-end delays have simply not been regarded in evaluating the quality of real time flows in SWAN. In cases where source and destination sensors are away off each other,
179
in terms of number of hops, real time packets go through increased end-to-end delays. We found our destination-based access on the basis that destination sensors could make better assessments of the rate of obtained real time flows by means of end-to-end delays. Thus, we propose the use of destination-based algorithm to resolve the dynamic regulation matters. In the research, we summarize the relevant factors of the original SWAN model in Section 2, and then in Section 3, we depict the setbacks of active regulation of real time flows. In Section 4, we demonstrate the two proposals rendered throughout the original SWAN framework like, source-based and networkbased algorithms, and then criticize both proposals. In Section 5, we present some terminologies necessary to discussing the active regulation and present the destination-based algorithm. Furthermore, we describe the intellectual behavior associated with our destination-based algorithm and explain the mechanism to limit the set of victim flows. In Section 6, the test-bed used to formalize the destination-based algorithm, and exemplify the test-bed, the actual result, analyze, and glance at the suggested enhancements. Eventually, in Section 7 we conclude the evidence and propose potential future research extensions.
2.
COMMON SWAN OPERATIONS
SWAN can be described over two major components. The Admission Controller (AC) is chargeable for including any novel flow to the sensor network. Admission control is carried out at the original source sensor that basically initiates real time flows. The Rate Controller (RC) is accountable for modulating BE traffic and keeping traffic loads at medium sensors and other factors are a Classifier, that chooses real time packets on to get around the shaper, and a Shaper, that stand for an simple leaky bucket traffic shaper. The purpose of the shaper would be to hold up BE packets in compliance together with the pace calculated by the RC. Figure 1 instances the architecture of the SWAN framework.
pre-marked / unmarked pkts IP send probe receive probe API request admit / reject
admission controller
marked / Classifier unmarked / ECN
marked pkts
unmarked pkts Shaper rate rate controller
packet delay MAC utilization of real-time traffic
shared me dia channel
FIGURE 1: Block Diagram of the SWAN Architecture
Admission Controller (AC) A mobile sensor would originate a real time flow rate just soon after finding a consent message in SWAN. SWAN-AC follows the popular Additive Increase Multiple Decrease (AIMD) algorithm, that's been utilized through the TCP congestion controller for many years. The TCP congestion control algorithm make sure that the scheme does work around or rather about the cliff as instanced on Figure 2, that guarantees maximum scheme throughput at the cost of having prominent queues, and in addition longer average delays. The SWAN AIMD admission controller algorithm complies a relatively cautious approach: SWAN maintains the scheme at the time-lag knee, the spot where the system throughput is virtually identical to the cliff, but queues are importantly far lower charged. SWAN employs MAC delay as a responses alternative to packet loss because of the fact that
180
typically happens at the cliff when delays evolve at the knee. This approach is exemplified in Morgan 03, Xue 10, and fully depicted in Morgan 11. Because of this cautious approach, SWAN resource utilization is lower than the available and assuming that the remainder bandwidth will likely run through by BE traffic. Additionally, this drop off bandwidth is usually considered as a safety step against the network dynamics which include bandwidth fluctuation and mobility. The AC sets out by directing a probe request on to the destination sensor and the medium sensors intercept the request also, renovate it with the bottleneck bandwidth. Intermediate sensors employees their AC onto estimate available bandwidth for newer real time flows, but they cannot enforce resource, or bandwidth allocation. The destination sensor responds through a probe reply to set the bottleneck bandwidth. Whenever the source sensor obtains the probing response packet, it can perform the source-based admission control by contemplating end-to-end bandwidth accessibility with the bandwidth demand as a way for the novel real time flow.
throughput delay delay "knee" congestion control "cliff"
load
FIGURE 2: General Behavior of a Congestion Controlled System
Classifier The source sensor grades packets consorted with acknowledged real time flow as real time. The classifier directs marked packets to the MAC layer instantly, getting around the shaper. SWAN implicitly presumes that real time flows need not to be policed. Shaper The shaper is a simple leaky delay queue that enforces delays on BE packets based on feedback from the Rate Controller (RC). Rate Controller (RC) The RC determines the link status utilizing link delay quantified by the MAC layer. For example, the delay can be extracted expending the IEEE 802.11 DCF mechanism. The RC finds extravagant link delay when one or maybe more packets have greater time-lags than a threshold link delay d (sec). The threshold delay d lies in the real time delay demands as mentioned in Ahn 02. When substantial link delay is noticed, RC backs off the rate by r %. RC should re-adjust parameters (d and r) each T seconds. The diagram shown in Figure 2 and most of this section refer to Morgan 11.
3.
DYNAMIC REGULATION ISSUES
SWAN presents active direction components in reply to stipulations produced by network characteristics like sensor mobility and off key admission. It is substantial to describe the presence of both topics on network resources.
n1
moving out Bandwidth rerouted to n2 without admission
s n2 mov ing
in
s n2
FIGURE 3: Congestion/Overload Due to Mobility
181
Mobility Figure 3 provides us the real time flow rates between sensors s and d can be rerouted off from sensor n1 to sensor n2 because of mobility and precisely the underlying routing algorithm executes the necessary rerouting. Even though sensor n2 will certainly go through growth in real time traffic, it could not execute any admission procedure to allow the novel flow. Particularly, backing up the new rerouted flows could induce the sensor to go through the congestion and this state represents the congestion due to mobility. False Admission As instanced in Figure 4, sensors s1, s2, and s3 typically originates an investigation request to direct real time flow rates to sensors d1, d2, and d3 via sensor n. If sensor n performs the three requests after a short time, the admission controller on sensor n can admit the three flows though it fairly has room for just one flow and that is because of the shortage of resource reservation in SWAN. Right until real time packets take in usable bandwidth, sensor n may always acknowledge novel real time flows. The resulting congestion at sensor n is known as congestion due to false admission.
s1
many probe req. accepted
d1
s2
d2
s3
less can be served
d3
FIGURE 4: Congestion/Overload Due to False Admission
It is vital to recognize the actual mobility and false admission but, it simply exemplifies two issues around other issues related to network dynamics. SWAN follows the explicit congestion notification (ECN) regulation algorithm to retrieve out from congestion terms induced by network dynamics. Because sensors are continuously and independently keeping track of their bandwidth usage all sensors would be able to notice violations. Clogged sensors are then going to apply the ECN bits through the IP header of typical real time packets to endure destinations of the presence of congestion. Every individual destination sensor is going to supply a modulate message onto the relevant source sensor and the source sensors will instantly re-initiate new probe demands to seek out an improved service route to the destination.
4.
COMMON DYNAMIC REGULATIONS
The determination of congested sensors to tag packets using ECN is absurdly decisive; because flows that are tagged with ECN may recede their QoS privileges. SWAN suggested two rules, namely source and network-based regulations. Both these regulations access mark ECN packets differently. 1. Source-Based Regulation A congested sensor tags RT flows with Congestion Experienced (CE) applying the ECN bits. When destination sensors run into packets with CE bit marked they direct the modulate content to the associated source sensors. Source sensors instantly execute a multiplicative drop off on relevant RT flows. As an effect, the congested sensor goes through a steady drop off in the amount of RT traffic right until the congestion status is withdrawn and the intermediate sensor stops marking CE bits. If the uncommitted reduced bandwidth of RT flow is ineffective to its source sensor, it must substitute a random short of time and then re-initiate a probe asking to re-establish the wanted level of service. Source sensors have to distribute the re-initiation to prevent a flash-crowd status during which sensors normally fall into other false admission once again, hence, the random backup time is necessary. Source-based regulation powers RT flows going through one congested sensor on to
182
regulate. This method appears to be aggressive and could force more flows to be regulated even if the period of bandwidth violation was constricted. Furthermore, it does not discriminate between dissimilar RT flows. 2. Network-Based Regulation A congested sensor chooses a subset out of all the real time flows to be a victim flow set in a network-based regulation and the congested sensor grades packets related with victim flows. It is potential for a congested sensor to categorize a particular set of RT flows by implementing a useful hash function with no demand to hold flow information. Packets of victim RT flows will attain relevant destination sensors marked based on CE, later the network-based outlook complies the similar procedure as depicted for source-based regulation. Supposing a congested sensor does not go through any drop off with the period of real time traffic soon after a period of time T seconds and it estimates a raw set of victim flows. SWAN adds some intelligence at the congested sensor in order to choose the set of victim flows. For E.g., supposing source sensors interpose RT-flows by tagging them as RT-old/RT-new employing the IP-TOS field. Congested sensors could use a biased function to organize the set of victim flows out of novel flows desiring to lessen false admission. Network-based regulation chooses precisely the victim flows set at random and in the good instance it separates against newly acknowledged flows.
5.
DESTINATION-BASED REGULATION
In the following subsections, we compare the projected destination-based regulation to other destination-based components and appear the difference. We identify the proposed plan and refine upon its preemptive and retrieval behaviors. Common Destination-based Approaches The idea of destination-based access is normally applied by a stack of QoS routing algorithms so as to boost the classic per-source-destination QoS routing coarseness. The most specific destination-based QoS routing algorithm is one during which QoS flows are tagged on a perdestination granularity as a way for ease in a compromise to cut back the algorithm complexity at average sensors. Altogether destination-based QoS routing algorithms, QoS flow rates which are discovered on a per-destination granularity so as to mimic ATM solutions. The classic role of destination-based approaches could be extended to function other targets like in which the technique is applied to scale bandwidth brokerage and service provisioning. The destination-based approach suggested in this research is different. Several QoS mechanisms are dependent on the source to spot the per-flow QoS parameters that substitute the end-to-end resources, and then transfer. Our proposition employs feedback data linked to the destination to aid congested, intermediate sensors identifying QoS flows that are enduring from network mobility. Therefore, it can be withdrawn to release the congestion and the destination-based approach provided at this point is unique.
80% 70% 60%
% Packets
50% 40% 30% 20% 10% 0% 0.00 0.05 0.10 0.15 0.20 0.25 0.30
Congested packets
Expired packets
Realtime Delay (sec)
FIGURE 5: SWAN RT packet delay histogram
183
Basic Definitions The advised intensified SWAN along destination-based regulation developed from the slack of SWAN design regarding model behavior in reaction to average traffic loads burden. The aboveaverage traffic load with at least one third of available usable bandwidth is ingested by real time traffic and one third by best-effort traffic. The time-lag histogram presented in Figure 5 exemplifies the majority of RT packets go through a time-lag of under 35 msec through the above-average traffic load condition.
100% 90% 80%
% Cumulative Packets
70% 60% 50% 40% 30% 20% 10% 0% 0.00 0.05 0.10 0.15 0.20 0.25 0.30
About 10% of delivered RT pkts are not usable
FIGURE 6: Cumulative RT packet delay %
Nevertheless, a substantial percentage of packets seem to go through delay higher than 175 msec. This is well defined on the cumulative graph in Figure 6. Where 9% of RT packets that appear to go through delays over the 175 msec. For example, interactive VoIP flows will disregard packets considering delays further than a stipulated threshold of 150 msec. By iterating the identical test for various assorted mobility scenarios, SWAN model would systematically causes about 9% of the of a typical RT packets to run out (9.04 %, 9.64 %, 9.97 %, 9.72 %, 10.03 %, and 9.87 %). So, the bandwidth gone through by extremely delayed packets is mostly a bandwidth that inappropriately consumes network resources and degrades services rendered to other early RT flows. Destination-based regulation relies on destination sensors to find an additional gain in expired bandwidth and then it modulates each flow consequently. This particular preemptive behavior complies with preserving network resources. The destination-based regulation chooses a subset of the congested flows with an intention to regulate in case of congestion. This subset is chosen primarily based on flow stream quality beginning with the lowest quality flows for the initial time. The grade of each flow is measured out as a function of the packet delays. Maximum Acceptable Packet Delay (MAPD) is the key threshold packet time-lag valuations/sec required to guarantee an end in the destination behavior of disregarding packets of a finite flow. MAPD is considered to be a flow-specific value that is referred by the destination sensor, which also compares to the end-to-end packet time-lag. Expired packets are usually the real time flow packets that, basically, display a time-lag over MAPD. Identically, the expired bandwidth equals the bandwidth downed by expired packets. Effective bandwidth = encountered bandwidth - expired bandwidth. Thus, effective bandwidth is precisely the bandwidth recognized over at destination sensor. It can be used by destination applications to rematch the real time cascade over a short time T. Limited QoS renders a flow to, more or less, the postulated bandwidth. However, a substantial portion of the obtained bandwidth is absolutely not functional as a result of excessive packet delays. The effective bandwidth comprehended as of destination sensor on a period of time T is scantily sufficient for the application to effectively replay the real time flow. Effective bandwidth ratio (EBR ) The percentage of average effective packet time-lags obtained in real time by the destination sensor being finite real-time flow over a period of time T. Due to the fact that the bandwidth ratio () lies on effective bandwidth and then , 0 1. Figure 7 along with equation 1 describe the EBR, and limited QoS definitions.
184
EBR =
effectiveBW receivedBW
overtimeT
(1)
EBR () measures out the grade of a RT flow rate during which the values closer to 1 would suggest high flow quality and the values closer to 0 argue modified flow quality with ineffective bandwidth use. RT flow-specific EBR rates (H, L) exemplify wanted measures of real time flow rate quality, during which the values below L stand for a junk in network resources that needs regulation. The important investigation request message would communicate both H and L values on to the destination sensor.
1 E R 6 1
High QoS
2 4 5
Limited QoS No QoS
L
0
BE
FIGURE 7: (EBR ) Service view in a loaded intermediate sensor
Effective delay ratio (EDR ) is known to be the percentage of intermediate, effective packet timelags at a desired destination sensor to MAPD over a period of time T. Simply because delay ratio () lies on effective bandwidth only, 0 1. Avg.eff .pktDelay EDR = overtimeT (2) MAPD Effective delay ratio quantifies the sum of the flow. EDR measures closer to 0 suggesting enhanced QoS. Whereas high EDR values closer to 1 would suggest a flow rate that is prone to high time-lag averages, although the quality is yet suitable as depicted in Equation 2. As mentioned in Figures 7 and Figure 8, a real time flow rate like flow 1 (symbolized by circle 1) can be a flow that gets better than average bandwidth and consequently features high QoS. Alternatively, flows 2, 3, and 4 are featuring confined QoS simply because they are obtaining the postulated bandwidth. On the contrary, their effective bandwidth is barely at the desired limit. Flow 5 demotes down to non-QoS and is unmarked through all intermediate sensors as a discrete RTflow any longer. Flow 1 holds a greater quality when compared to flow 6. The remainder could be stated with the flow rates of and. Preemptive Behavior The destination-based algorithm is built over two behaviors, first, preemptive behavior that screens QoS obtained by the network and upgrades services when provided service is unsatisfying. The other is the recovery behavior, which is accomplished when intermediate sensors encounter congestion by modulating limited QoS flows in advance of regulating higher QoS flows. The destination sensors modulate flows that are receiving limited QoS with short of noticing congestion status. Essentially, when an adequate number of packets reach destination sensor along with delays higher than MAPD over a time period T , the destination sensor finds a modified QoS status ( < L), and inserts a modulate message to the appropriate source sensor. The source sensor then actuates a re-initiate process to identify a different route with more beneficial quality.
185

0 EDR 1 6
High QoS
3 1
2 4 5
Limited QoS No QoS
BE
FIGURE 8: (EDR ) Service view in a loaded intermediate sensor
Recovery Behavior Recovery behavior is activated by destination sensor that enforces the following mechanisms: a) Whenever an intermediate sensor is congested, it tags every individual RT packets along with CE applying the ECN bits and packet markings would run right until the intermediate sensor experiences an adequate drop in the incoming bandwidth. b) Destination sensors experiencing ( 1) are going to release a modulate message instantly. c) Early destination sensors are sure to wait for time period T. Supposing packets continue getting marked with CE, after that destination sensors with ( 2) might issue setback a modulate message instantly. d) Traditionally, congestion gets settled by eliminating flows with higher comparative time-lags and the values of is going to be constant for the network, and then possess to be chosen such that (i > i+1). This mechanism allows several destination sensors to modulate related real time flows on their own by regulating low quality flows for start. When congestion is not decided flows featuring slightly satisfactory quality are modulated till congestion is resolve.
6.
EVALUATION AND ANALYSES
The primary rating perspective normally appears to compare the suggested destination-based method using both source-based and network-based regulations. Although the source-based regulation is simply an exceptional example of network-based regulation in which the subset of dupe flows is the global set. Concerned reviewers would be able to review an evaluation between source and network-based regulations. Our examination demonstrated the assertive and striking conduct of source-based regulation which could be easily upgraded by adopting network-based regulation as proposed by Ahn 02 or as adopting destination-based regulation as illustrated here. Test-bed Description Therefore, this Part equates destination-based regulation via a matured network-based regulation. Ns-2 simulator is used to examine the destination-based approach. The test-bed presumes a square field along with 20 sensors traversing with a maximum speed of 10 meter per seconds with a random pause time of 2 sec. The test-bed functions parametric quantities out of a Lucent WaveLAN card to organize a radio link applying 802.11 as MAC layer during which all moving sensors holds a transmission range of 250 m. Sensor network On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocols are the two routing protocols arbitrary selected for evaluation. The traffic generator expends both constant and variable bit rate RT-applications (CBR/VBR). Furthermore, we apply TCP links by simulating greedy FTP applications for packet size 512 bytes. The TCP connections render (BE) packets that will not likely require QoS services. Real time VoIP runs set up a MAPD of 150 msec and the burst video flows takes 450 msec. Lastly, the count up simulation time is 300 secs, EBR (H, L) values are (0.97, 0.95) and EDR( ) set values are {0.9, 0.8, , 0.2, 0.1}as a way for all the RT flows.
186
Bandwidth Efficiency To be able to glance out the destination-based approach SWAN and ESWAN test-bed are susceptible to the exact same traffic patterns and mobility scenario. The quantity of subjected and presented RT bandwidth is supervised throughout the simulation time. The actual results are displayed in Figure 9 and Figure 10 for SWAN and ESWAN. Hence, from the Figure 9 and Figure 10 it is straightforward to understand that the subjected bandwidths are quite identical in both SWAN and the ESWAN test-bed. The presented bandwidth has a tight match to the subjected bandwidth in ESWAN than the SWAN. ESWANs destination-based approach mainly relies on the quality and also the usability of traversed RT bandwidth. It is extremely important to seek the expired RT bandwidth with the EBR ratio as specified earlier to be able to study the efficient bandwidth delivery on destination sensors.
FIGURE 9: Efficiency of Bandwidth Usage in SWAN
Bandwidth Evaluation View Figure 11 illustrates the distribution of run out RT bandwidth in SWAN and ESWAN. The chosen traffic pattern sets off the ESWAN pre-emptive conduct at approximately 60 secs soon after simulation begins it stimulates congestion on both SWAN and ESWAN models around 230secs from simulation start time. Operating the depicted test-bed applying SWAN and ESWAN models we are going to notice a substantial drop off in the period of expired RT bandwidth that improves network resources usage.
FIGURE 10: Efficiency of Bandwidth Usage in ESWAN
187
It is simple to realize that the fact of preemptive conduct stimulates a practical ceiling of a period of expired RT bandwidth from a Figure 11. SWAN then again causes no enforce on the amount of expired RT bandwidth alternatively it modulates flows merely soon after congestion takes place by feeling the link. Shortly after 230 sec of simulation time congestion happens and drives the regulation of RT flows in SWAN and also ESWAN simulations. The tip amount of expired RT bandwidth in SWAN does not relate to congestion as illustrated in Figure 11.
Expired RT BW
16 Expired RT BW (kbps) 14 12 10 8 6 4 2 0 120 150 180 210 240 270 300 30 60 90 RT SWAN RT eSWAN
Peak RT pkt drop Congestion caused regulation
Preemptive behavior f orced early regulation
Simulation Time in sec
FIGURE 11: Distribution of Expired RT Bandwidth
Figure 12 illustrates the statistical distribution of EBR for SWAN and ESWAN. The preemptive doings of ESWAN observes a limited QoS status at approximately 60 sec of simulation time and then ESWAN pushes a re-regulation of relevant RT flows. Hence, ESWAN presents modified fluctuations of the EBR value. SWAN on the other hand features no restrictions on the EBR values. So, the EBR value sinks to the small sum of 90 %. During 230 sec of simulation time SWAN and ESWAN notice congestion, where as SWAN applies network-based recovery and ESWAN employs destination-based recovery. This explanation would be clear from Figure 12. Figure 12 shows how ESWAN goes back slower and stimulates fewer disruptions to RT flows in comparison with the radical recovery of SWAN. It is crucial to understand that before the onset of congestion SWAN simply didn't identify any trouble with RT flows and consequently RT flows was not regulated. As an effect RT flows on SWAN went through less quality which network would supply.
EBR (Effective BW Ratio) for RT Traffic
102% 100% RT SWAN RT eSWAN
Preemptive behavior
EBR B
98% 96% 94% 92% 90% 120 150 180 210 240 270 300 30 60 90
Congestion & recovery behavior
FIGURE 12: EBR Distribution for SWAN and ESWAN
Delay Evaluation View Figure 13 depicts the preemptive conduct tripped on 60 sec of simulation time forces and also, presents the minor delays in ESWAN compared to SWAN. Congestion encounters at 230 sec of simulation time which is quite unique. Flows go through relatively less congested sensor than SWAN in ESWAN and that is the impact of preemptive behavior. The retrieval behavior on ESWAN is a trifle lower radical.
188

EDR (Effective Delay Ratio ) for RT Traffic
100%
Preemptive behavior
RT SWAN RT eSWAN
80% 60% 40% 20% 0% 120 150 180 210 240 270 Simulation Time in sec 300
0.30
Congestion & recovery behavior
EDR d
30
60
FIGURE 13: EDR Distribution for SWAN and ESWAN
Figure 14 illustrates the necessary instance on consequence of destination-based algorithm on BE packet time-lags. The preemptive behavior is evoked around 60 sec of simulation time which induces the BE intermediate delays to peak soon after. Typically, the delay fluctuation of BE traffic is higher in ESWAN when compared to SWAN. Even though this issue might not create functioning issues as BE traffic belongs to elastic applications that tolerate such fluctuations.
Avg BE packet Delay
2.0 Delay peak Avg BE Delay in sec 1.5 BE SWAN BE eSWAN
1.0 Preemptive behavior 0.5 Slow recovery of eSWAN 120 150 180 210 240 270
0.25
0.0 300 30 60 90
90
FIGURE 14: Distribution of Average BE Packet Delay
Figures 15 and 16 depict the histogram with accumulative statistical distribution of RT packet delay in ESWAN. These figures are quite comparable to Figures 5 and 6. In ESWAN, not as much as 1.2 % of the rendered RT packets expired. The ESWAN model systematically turned up only 1.2 % of RT packets to expire 1.13 %, 1.16 %, 1.17 %, 1.15 %, 1.16 %,and 1.14 % while test result repetitions for several mobility scenarios.
80% 70% 60%
% Packets
50% 40% 30% 20% 10% 0% 0.00 0.05 0.10 0.15 0.20
Fewer congested packets
Fewer expired packets
FIGURE 15: RT packet delay histogram in ESWAN
189
Destination sensors apply this modified percentage to supervise the services coming from network and force regulation when needed. When compared the figures with comparable results from Part 5, ESWAN model holds decreased percentage of run out RT packets by 7.91 %, 8.48 %, 8.80 %, 8.57 %, 8.87 %, and 8.73 %. The Confidence Interval for the series can be estimated by applying Equation (3). 0%10%20%30%40%50%60%70%80%90%100%
100% 90% 80% 70%
Cumulative %
60% 50% 40% 30% 20% > MAPD 10% 0%

0.00 0.05 0.10 0.15 0.20 0.25 0.30
About 1.2 % only of deliv ered RT pkts are un-usable
FIGURE 16: Cumulative RT packet delay % in ESWAN
ConfidenceInterval= X t a
Where:
( ) 2
. (3)
X = The mean difference between SWAN and ESWAN observations

n = Number of samples (n=6).
= The standard deviation of the

difference between SWAN and ESWAN observations. (1-) = Confidence level (=0.05). t a =The upper critical value of
( ) 2
the t distribution (=2.45). The confidence interval for the percentage of decrease in expired RT packets when using ESWAN compared to when using SWAN is calculated based on the 6 observation samples. The 95% confidence interval is [8.21%, 8.91%]. As this interval does not include 0, the performance improvement by ESWAN is statistically significant, even with our somewhat limited sample size of 6. This percentage gain in RT packets has a significant impact on the delivered RT quality and on the user perception. The Effect of Mobility Sensor mobility is an important factor in the design and evaluation of VANET based technologies. The speed of mobile sensors and their pause time are commonly used attributes to define mobility. The test-bed used pause time of 2 seconds, and when changing the pause time, both SWAN and ESWAN showed little changes in behavior. When running the same test-bed with sensor speed of {10, , 50} meter per second, both SWAN and ESWAN maintained the same level of average packet loss as illustrated in Figure 17 up to sensor speed of about 35 meter per second.
190

Effect of Mobility on RT -Packet Loss
80 0
Avg # of Lost Packets / node
700
60 0
500
eSWAN
40 0
30 0
20 0
SWAN
100 10 15 20 25 30 35 40 45 50
Node Speed (meter/sec)
FIGURE 17: The effect of sensor mobility on average packet loss
When mobile sensors move faster than 35 meter per second, deterioration in radio link quality takes effect. ESWAN shows a higher number of packet losses, and the losses grow much faster compared to SWAN. The reason is the preemptive behavior in ESWAN, which responds to the limited QoS perceived at destination sensors by forcing too many re-initiate probe requests flooding the relevant routes and causing congestion, and packet loss. SWAN, on the other hand, relies on re-routing, which is sufficient in high mobility scenarios. Therefore, ESWAN is recommended in installations involving limited mobility (i.e. 35 m/s). We believe this is not a major restriction since the threshold speed here is beyond vehicular speed limits (i.e. 125 km/hr). Overall Evaluation In order to investigate the behavior of EBR (), and EDR () ratios, we apply some changes to the test-bed. An increasing traffic load is applied to a five mobile sensors test-bed, and the total consumed bandwidth is measured then normalized over a period of time T sec. The mobile sensors are forced to a no mobility condition, and the values of ( and ) ratios of a VoIP flow are observed against the increasing RT traffic load of the network. Figure 18 and Figure 19 represent the results under these conditions. In both figures, the horizontal axes (average load per sensor) represent the normalized collective bandwidth consumed by all five sensors for RT flows. Therefore, the exact values of the network RT load will vary based on the test-bed topology, flow directions, setup, and configurations; however, the shape of the curves will remain the same.
Change in EBR Under Increasing NW Load
100% 99%
98%
SWAN
eSWAN due to pre emptive beha vior
97%
96%
95%
94% 93%
92% 2,000 2,100 2,200 2,300 2,400 2,500 2,600 2,700 2,800 2,900 3,000 3,100 3,200 3,300 3,400 3,500 3,600 3,700 3,800 3,900 4,000 4,100 4,200 4,300 4,400 4,500 4,600 4,700 4,800 4,900 5,000
Network Load (bps/node)
FIGURE 18: The effect of network load on EBR
Figure 18 illustrates the impact of increasing overall network RT load on the EBR (). Due to the preemptive behavior, ESWAN tends to show higher EBR () values than classical SWAN. EBR () values lower than 95% are regulated by ESWAN, and the re-initiation of RT flows provides either higher EBR () value, or the RT flow will be denied service, and hence, have no EBR ().
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 191

Change in EDR Under Increasing NW Load
90% 80% 70% 60% 50% 40% 30% 20%
SWAN
due to recovery behavior
eSWAN
10% 0% 1,000 1,200 1,400 1,600 1,800 2,000 2,200 2,400 2,600 2,800 3,000 3,200 3,400 3,600 3,800 4,000 4,200 4,400 4,600 4,800 5,000 200 400 600 800 0
Network Load (bps/node)
FIGURE 19: The effect of network load on EDR
Figure 19 illustrates the impact of increasing overall network RT load on the EDR (). When network RT load increases, the effective average packet delay increases, hence the EDR (). There are relatively lower values for EDR () on ESWAN than SWAN due to the recovery behavior. High values of (> 70%) are commonly associated with congestion, while low values (< 10%) are associated with healthy RT flows.
7.
COMMENTS AND CONCLUSION
The actual SWAN model presents only the source and network regulations algorithms as solutions for regulating real time flows and brings out the two rules to deliver total congestion recovery. SWAN results put on random array of victim flows and consequently offer little value to the model. This research presents a novel destination-based regulation to boost the congestion retrieval of real time flows instead of the source or network based regulations. The destination-based regulation habituates a predetermined rule to choose victim flows and appends a preemptive behavior to decrease the frequent occurrence of congestion. Packets tripping over prominent sensors network may go through tenacious time-lags for the reason that travel over more hops. Applying the MAPD threshold expends the EDR (), allows the network to restrain run out bandwidth that liberates portion of the traffic load and finally increases bandwidth availability and efficient use of RT bandwidth. This augmentation arrives at the expense of BE traffic that realizes comparatively high pitched average delays, but has got only a minor influence on the BE bandwidth. The preemptive behavior is depicted to polish the resource utilization gradually and to diminish probability of congestion. Furthermore, it allows destination sensors to supervise the exact level of service and request a service ascent when the rendered service is unsatisfactory. The recovery behavior of the destination-based approach renders quicker recovery when compared to the network-based approach introduced by SWAN. A reliable recuperation is efficient in interrupting a lesser amount of RT flows, and provides less average variation in RT delays. Furthermore, ESWAN is proven to diminish the amount of expired RT packets by about 8.5 %, which stands for a significant improvement compared to the original SWAN execution. A number of the components specified in SWAN and in our research work are based on the shaping rate (T seconds). The time period T is actually minor decent to interact with network dynamics and prominent enough to average out the high traffic volumes generated by burst traffic. SWAN and ESWAN test-beds operate the value of 2 seconds for T. Destination sensors can comfortably allot a value for MAPD based on info from the application layer. The MAPD values alter substantially with regards to the application, but is very substantive in customizing the QoS demands for every flow. The destination-based method acquaints EBR (), and EDR () as two significant parameters to measure real time flow quality. These parameters want to be configured at the session start utilizing probe requests. Exploiter satisfaction is a vital factor in delimiting acceptable thresholds for both these parameters. For example, streaming real time flows may be able to tolerate larger jitter buffers than interactive real time flows; as a result, we expect the values to be more stringent for interactive real time flows.
192
Consequently, further research needs to be performed on the ideal and acceptable values of both parameters. An alternative crucial factor in measuring the SWAN model is investigating the pragmatic approach for bandwidth utilization. SWAN follows a materialistic view of bandwidth availability when admitting new real time flows, assuming that the tenacious slack of bandwidth may be used by best-effort traffic. Hence, SWAN accomplishes comparatively higher resource utilization in installations that has equivalent real time, best-effort volume of traffic and in installations with limited variations in radio link quality. Supplementary research is required to measure and tune SWAN for environments with skewed percentages of traffic types and highly variable radio link quality. Likewise an evaluation with Shah Approach is very significant in measuring the end-to-end performance. Abbreviations and Acronyms BE CBR DiffSe rv DNST Best Effort Constant Bit Rate Differentiat ed Service Model Downstrea m (destination is a vehicle in the V2V network) Dedicated ShortRange Communic ations Expedited Forwardin g Enhanced SWAN QoS model for V2V networks File Transfer Protocol Hop Count HyperText Transfer Protocol Institute of Electrical and Electronics Engineerin g INSIG NIA In-band Signaling QoS model for V2V networks Internet Protocol The Moving Picture Experts Group digital video format Mobile Truck Model The Network Simulator version 2 Quality of Service Real-time Stateless Wireless V2V Networks Transmissi on Control Protocol Upstream (source is a vehicle in the V2V network)
IP MPE G
DSRC
MTM
EF
NS2
ESWA N
QoS RT SWA N
FTP
HC HTTP IEEE
TCP
UPST
193
V2V
Vehicle-toVehicle Communic ation
VBR
Variable Bit Rate
8.
[1]
REFERENCES
Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres, and Li-Hsiang Sun, SWAN: Service Differentiation in Stateless Wireless VANET Networks, Proceeding of the IEEE Infocom, June 2002. Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres, and Li-Hsiang Sun, "Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless VANET Networks (SWAN)", IEEE Transactions on Mobile Computing, September 2002. Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres, and Li-Hsiang Sun, "SWAN", IETF draft, MANET workgroup, October 2002. Josh Broch, David B. Johnson, Yih-Chun Hu, and Jorjeta Jetcheva, "A Performance Comparison of Multi-hop Wireless VANET Networking Routing Protocols", IEEE Proceeding of the ACM/IEEE 4th. International Conference on Mobile Computing and Networking (MobiCom' 98), Dallas TX, USA, October 1998. Shigang Chen, and Klara Nahrstedt, Distributed Quality-of-Service Routing in VANET Networks, IEEE Journal on Selected Areas in Communication, vol. 17, no. 8, pp. 1488-1505, August 1999. D. Chiu and R. Jain, Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks, Computer Networks, 1989. S. Corson, and J. Macker, Mobile VANET Networks: Routing Protocol Performance Issues and Evaluation Considerations, IETF RFC 2501, January 1999. David B. Johnson, David A. Maltz, Yih-Chun Hu, and Jorjeta G. Jetcheva, "The Dynamic Source Routing Protocol for Mobile VANET Networks (DSR)", IETF draft, MANET workgroup, February 2002. Seoung-Bum Lee, Gahng-Seop Ahn, Xiaowei Zhang and Andrew T. Campbell, INSIGNIA: An IP-Based QoS framework for Mobile VANET Networks, Journal of Parallel and Distributed Computing, vol. 60, no. 4, pp 374-406, April 2000. Mohammad Mirhakkak, Nancy Schult, and Duncan Thomson Dynamic QoS and Adoptive Applications for variable Bandwidth Environment, MITRE-DoD project paper, URL: <http://www.mitre.org/support/papers/archive99_00.shtml>, April 2000.
[2]
[3] [4]
[5]
[6] [7] [8]
[9]
[10]
[11] Y. Morgan, and T. Kunz, "PYLON: An Architectural Framework for VANET QoS Interconnectivity with Access Domains", Proceedings of the 36th Hawaii International Conference on System Sciences, Hawaii USA, January 2003. [12] Charles E. Perkins and Elizabeth M. Royer, VANET On Demand Distance Vector Routing, Proc. IEEE Workshop Mobile Computing Systems and Applications, Feb. 1999. [13] Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das, "VANET On-Demand Distance Vector (AODV) Routing", IETF draft, MANET workgroup, June 2002.
194
[14] Y. Morgan and T. Kunz, "An Applied Mobile Truck Model (MTM) for on-the-Road DataProbing," in the International Journal for Heavy Vehicle Technologies, April 2011, vol. 18, no. 2. [15] Samarth H. Shah, Kai Chen, Klara Nahrstedt, "Dynamic Bandwidth Management for Singlehop VANET Wireless Networks", ACM/Kluwer Mobile Networks and Applications (MONET) Journal, Special Issue on Algorithmic Solutions for Wireless, Mobile, VANET , vol. 10, num. 1, 2009. [16] Joao L. Sobrinho and A. S. Krishnakumar, Quality-of-Service in VANET Carrier Sense Multiple Access Networks, IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, pp. 1353-1368, August 1999.
[17] Andras Veres, Andrew T. Campbell, Michael Barry and Li-Hsiang Sun, Supporting Service Differentiation in Wireless Packet Networks Using Distributed Control, IEEE Journal of Selected Areas in Communications, Special Issue on Mobility and Resource Management in Next-Generation Wireless Systems, Vol. 19, No. 10, pp. 2094-2104, October 2001. [18] Hannan Xiao, Winston K.G. Seah, Anthony Lo, and Kee Chaing, Flexible QoS Model for Mobile VANET Networks, IEEE Vehicular Technology Conference, VTC 20009-spring, IEEE 51st, vol. 1, pp 445-449, Tokyo, May 2009. [19] Yuan Xue, Baochun Li, Klara Nahrstedt, "Optimal Resource Allocation in Wireless VANET Networks: A Price-based Approach", in the IEEE Transactions on Mobile Computing, 2010. [20] Network Simulator version 2 <URL: http://www.isi.edu/nsnam/ns/>.
[21] Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Standard 802.11, June 1999. [22] H. Mantar, J. Hwang, I. Okumus, and S. Chapin "A Scalable Model for Interbandwidth Broker Resource Reservation and Provisioning", in the IEEE Journal on Selected Areas in Communications, vol. 22, no. 10, December 2004. [23] T. Korkmaz and J. Guntaka "State-Path Decoupled QoS-based Routing Framework", in the Proceedings of the IEEE Communication Society, Global Communication Conference, Globocom 04, vol. 3, pp. 1515-1519, Dallas, TX, USA, December 2004. A. Riedl "A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics", in the IEEE Workshop on IP Operations and Management, IPOM 02, pp. 166-170, Dallas, TX, USA, October 2002.
[24]
[25] Y. Chen, R. Hwang and Y. Lin "Multipath QoS Routing with Bandwidth Guarantee", in the Proceedings of the IEEE Communication Society, Global Telecommunications Conference, Globocom 01, vol. 4, pp. 2199-2203, San Antonio, TX, USA, November 2001.
195
INSTRUCTIONS TO CONTRIBUTORS
The International Journal of Computer Networks (IJCN) is an archival, bimonthly journal committed to the timely publications of peer-reviewed and original papers that advance the stateof-the-art and practical applications of computer networks. It provides a publication vehicle for complete coverage of all topics of interest to network professionals and brings to its readers the latest and most important findings in computer networks. To build its International reputation, we are disseminating the publication information through Google Books, Google Scholar, Directory of Open Access Journals (DOAJ), Open J Gate, ScientificCommons, Docstoc and many more. Our International Editors are working on establishing ISI listing and a good impact factor for IJCN. The initial efforts helped to shape the editorial policy and to sharpen the focus of the journal. Starting with volume 3, 2011, IJCN appears in more focused issues. Besides normal publications, IJCN intend to organized special issues on more focused topics. Each special issue will have a designated editor (editors) either member of the editorial board or another recognized specialist in the respective field. We are open to contributions, proposals for any topic as well as for editors and reviewers. We understand that it is through the effort of volunteers that CSC Journals continues to grow and flourish. IJCN LIST OF TOPICS The realm of International Journal of Computer Networks (IJCN) extends, but not limited, to the following: Algorithms, Systems and Applications ATM Networks Cellular Networks Congestion and Flow Control Delay Tolerant Networks Information Theory Metropolitan Area Networks Mobile Computing Multicast and Broadcast Networks Network Architectures and Protocols Network Modeling and Performance Analysis Network Network Security and Privacy Optical Networks Personal Area Networks Telecommunication Networks Ubiquitous Computing Wide Area Networks Wireless Mesh Networks Ad-hoc Wireless Networks Body Sensor Networks Cognitive Radio Networks Cooperative Networks Fault Tolerant Networks Local Area Networks MIMO Networks Mobile Satellite Networks Multimedia Networks Network Coding Network Operation and Management Network Services and Applications Peer-to-Peer Networks Switching and Routing Trust Worth Computing Web-based Services Wireless Local Area Networks Wireless Sensor Networks
CALL FOR PAPERS Volume: 4 - Issue: 1 February 2012 i. Paper Submission: November 31, 2011 ii. Author Notification: January 01, 2012
iii. Issue Publication: January / February 2012
CONTACT INFORMATION
Computer Science Journals Sdn BhD B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, MALAYSIA Phone: 006 03 6207 1607 006 03 2782 6991 Fax: 006 03 6207 1697
Email: cscpress@cscjournals.org

Ijcn V3 I3

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Ijcn V3 I3

Enviado por

Direitos autorais:

Formatos disponíveis

INTERNATIONAL JOURNAL OF COMPUTER NETWORKS (IJCN)

VOLUME 3, ISSUE 3, 2011 EDITED BY DR. NABEEL TAHIR

IJCN Journal is a part of CSC Publishers Computer Science Journals http://www.cscjournals.org

INTERNATIONAL JOURNAL OF COMPUTER NETWORKS (IJCN)

CSC Publishers, 2011

Volume 3, Issue 3, August 2011

Divya Sharma & Ashwani Kush

GPS Enabled Energy Efficient Routing for Manet

2. POWER RELATED ISSUES

Divya Sharma & Ashwani Kush

Divya Sharma & Ashwani Kush

Divya Sharma & Ashwani Kush

Signal Reception Physical Layer Signal Transmission Mac Layer

FIGURE 1: Information sharing in Cross Layer Design

Divya Sharma & Ashwani Kush

FIGURE -3 : Local repair scheme

Divya Sharma & Ashwani Kush

Divya Sharma & Ashwani Kush

Divya Sharma & Ashwani Kush

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

ETFRC: Enhanced TFRC for Media Traffic over Internet

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

2. THE TFRC PROTOCOL

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

3 ENHANCED TFRC ETFRC PROTOCOL

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

FIGURE 1: EvalVid Tool-set.

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

FIGURE 2: Simulations Topology

TABLE 1: The Video Sequences Used in Simulations.

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

FIGURE 3: PSNR Values Vs n

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

FIGURE 4: PSNR Values Vs n and Nfb

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

Mohammad A. Talaat, Magdi A. Koutb & Hoda S. Sorour

[12] [13] [14] [15]

Y. Morgan, T. Kunz & M. El-Gindy

Effective Streaming of Clustered Sensor Data in Harsh Environment

Y. Morgan, T. Kunz & M. El-Gindy

Y. Morgan, T. Kunz & M. El-Gindy

COMMON SWAN OPERATIONS

marked / Classifier unmarked / ECN

unmarked pkts Shaper rate rate controller

packet delay MAC utilization of real-time traffic

shared me dia channel

FIGURE 1: Block Diagram of the SWAN Architecture

Y. Morgan, T. Kunz & M. El-Gindy

FIGURE 2: General Behavior of a Congestion Controlled System

DYNAMIC REGULATION ISSUES

FIGURE 3: Congestion/Overload Due to Mobility

Y. Morgan, T. Kunz & M. El-Gindy

less can be served

FIGURE 4: Congestion/Overload Due to False Admission

COMMON DYNAMIC REGULATIONS

Y. Morgan, T. Kunz & M. El-Gindy

Realtime Delay (sec)

FIGURE 5: SWAN RT packet delay histogram

Y. Morgan, T. Kunz & M. El-Gindy

About 10% of delivered RT pkts are not usable

Realtime Delay (sec)