MOCAVI: An Efficient Causal Protocol for Cellular Networks
|
|
- Lester Taylor
- 5 years ago
- Views:
Transcription
1 136 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January 2008 MOCAVI: An Efficient Causal Protocol for Cellular Networks Eduardo Lopez Doinguez, Saul E. Poares Hernandez and Gustavo Rodriguez Goez Coputer Science Departent National Institute of Astrophysics, Optics and Electronics (INAOE), Luis Enrique Erro #1, 72840, Tonantzintla, Puebla, Mexico Suary A cellular network consists of two ain coponents: base stations (BS) and obile hosts (). It is through base stations that obile hosts can counicate. In order to reduce the causal overhead and the coputational cost over obile hosts, ost of the existing protocols for cellular networks ensure causal order at BSs. However, these protocols introduce unnecessary inhibition of delivery of essages since the causal ordering is carried out according to the causal view of the BSs and not in absolute accordance with the causal view of the s. In this paper, we present MOCAVI, an efficient protocol that ensures causal ordering according to the causal view of obile hosts, through which we avoid the unnecessary inhibition of essage delivery while aintaining a low overhead and coputational cost. Key words: Causal ordering, obile causal view, cellular networks, iediate dependency relation. 1. Introduction In recent years, cellular networks have experienced several exciting innovations and will continue to represent a rapidly growing sector in the near future. The evolution of cellular networks establishes a trend to use portable coputing devices, such as sart phones and personal digital assistants (PDAs). In conjunction with wireless counication technologies, cellular networks enable users to access the internet at anytie and anywhere in the world. The goal is to provide users with access to desktop applications, applications specially suited for obile users, and ultiedia applications. However, cellular networks involve new characteristics and constraints, such as changeable physical network connections, liited processing and storage capabilities in obile devices, as well as liited bandwidth on wireless counication channels. Many protocols have been proposed for cellular networks in different research areas such as causally ordered essage delivery [2-9], utual exclusion [13], and checkpoint protocols [14]. In this paper, we consider the proble of causal order essage delivery aong obile hosts in the context of group counication. Soe protocols [2-9] have been proposed to ipleent causal essage ordering over cellular networks. In order to reduce coputational costs and counication loads on obile hosts, ost of these protocols store relevant data structures in the base stations (BS), and they are executed by the BSs on behalf of the obile hosts (). These ethods give rise to two ain probles. First, the causal order seen by the BSs differ fro the causal order seen by the s. Secondly, they introduces unnecessary inhibition of essage delivery. This unnecessary inhibition is due to the serialization of essages at the BSs level. The serialization of essages appears since a base station is unable to detect utual concurrency between essages occurring at different s in its cell. In this paper, we propose a new protocol called MOCAVI, which ensures the causal ordering according to the causal view that the obile hosts perceive during the syste execution, avoiding unnecessary inhibition of essage delivery while aintaining a low overhead and coputational cost. To achieve this, we differentiate two counication levels according to the connection type (wired and wireless): intra-base counication level and inter-base counication level. At the intra-base counication level (wireless connection) we only send as causal overhead, between a BS and the s attached to it, a vector of bits Φ of size n (Φ(n), where n is the nuber of participants in the group). At the inter-base counication level (wired connection) we only send as causal overhead, between BSs, inforation about essages that are related through iediate dependence [11]. As we will show, the vector Φ(n) used at the intrabase counication level is sufficient to ensure causal essage ordering as seen by the s of the syste. The rest of this paper is organized as follows. Section 2 presents the syste odel, background, and definitions. A description of the proposed protocol in this work is provided in Section 3. Next, in Section 4 we copare our protocol with other works in two aspects: essage overhead and unnecessary inhibition in essage delivery. Finally, conclusions are presented in Section 5. Manuscript received January 5, 2007 Manuscript revised January 20, 2007
2 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January Preliinaries 2.1 The Syste Model A cellular network consists of two kinds of entities: obile support stations or base stations and obile hosts. A base station (BS) has the necessary infrastructure to support and counicate with obile hosts. The BS counicates with obile hosts through wireless counication channels. The geographic area covered by a base station is called cell, figure 1. A obile host () is a host that can ove while retaining its network connection. At any given tie, a is assued to be within a cell of at ost one BS, which is called its local BS. A can counicate with other s and BSs only through its local BS. We assue in this paper that the wireless counication channels between s and BSs are FIFO and reliable. The base stations are connected aong theselves using wired channels. The BSs and the wired channels constitute the static network. We assue that the wired channels are reliable and take an arbitrary but finite aount of tie to deliver essages. Due to syste asynchrony and unpredictable counication delays, the sent essages on cellular network can arrive in a different order as they were sent. Cell BS BS Cell Wired network Cell Figure 1. Cellular network architecture In a cellular network, a obile host can ove fro one BS to another. In this case, a hand-procedure (not presented in this paper) is perfored to transfer the counication responsibilities of to the new BS. BS BS Cell With respect to the logical specification in our work, the application under consideration is coposed of a set of obile hosts P = {i, j, n} organized into a group that counicates by reliable broadcast asynchronous essage passing. We consider a finite set of essages M, where each essage Î M is identified by a tuple = (p,t), where pîp is the sender of, denoted by Src(), and t is the sequential ordered logical clock for essages of p when is broadcasted. The set of destinations of a essage is always P. 2.2 Background and Definitions Causal ordering delivery is based on the causal precedence relation defined by Laport [10]. The happened-before relation establishes, over a set of events, possible precedence dependencies without using physical clocks. It is a partial order defined as follows: Definition 1. The causal relation is the least partial order relation on a set of events satisfying the following properties: If a and b are events belonging to the sae process and a was originated before b, then a b. If a is the send essage of a process and b is the reception of the sae essage in another process, then a b. If a b and b c, then a c. By using Definition 1 we can cay that a pair of events are concurrent related a b only if Ø (a b Ú b a). The precedence relation on essages denoted by is induced by the precedence relation on events, and is defined by: Û send() send( ) The Iediate Dependency Relation. The Iediate Dependency Relation (IDR) foralized in [11] is the propagation threshold of the control inforation regarding the essages sent in the causal past that ust be transitted to ensure a causal delivery. We denote it by, and its foral definition is the following: Definition 2. Iediate Dependency Relation (IDR): Û[ ( ) Ù " Î M, Ø( )] Thus, a essage directly precedes a essage, iff no other essage belonging to M exists (M is the set of essages of the syste), such that belongs at the sae tie to the causal future of and to the causal past of.
3 138 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January 2008 This relationship is iportant because if the delivery of essages respects the order of the diffusion for all pairs of essages in an IDR, then the delivery respects the causal order for all essages. This property is forally defined for the broadcast case as follows: Property 1: If ", Î M, Þ " p Î P : delivery(p,) deliver(p, ) then Þ "p Î P : delivery(p,,) delivery(p, ) Causal inforation that includes the essages iediately preceding a given essage is sufficient to ensure a causal delivery of such essage. Transission tie of essage ( d() ) We analyze the necessary tie for transitting a essage by a obile host p i to another obile host p j. Both obile hosts within the cell are covered by the base station BS r. First, the obile host p i sends a essage to its local base station BS r over a wireless counication channel. The local base station BS r receives the essage at a tie t. Before the transission of essage to obile host p j, the base station BS r attached control inforation to essage in a tie period called processing_tiebs r (). Finally, BS r sends the essage at tie t to obile host p j through a wireless counication channel, figure 2. BS r p i p j t Figure 2. Transission tie of a essage into its local cell. Thus, we can divide the necessary tie to transit a essage into three parts. uplink_tie(): transission tie in wireless counication channels for a essage fro the obile hosts to its base station. processing_tie(): period of tie necessary used by a base station to attach control inforation to the received essage. t d() downlink_tie(): transission tie in wireless counication channels for a essage fro the base station to a obile host. Therefore, the total transission tie of a essage is equal to: d()= uplink_tie() + processing_tie() + downlink_tie() + e In our case, we consider a possible error in the variation tie represented by the variable e. 3. The Causal View Protocol Protocol overview Fro the point of view of the physical architecture, we consider two counication levels in a obile syste: Intra-base and Inter-base. The Intra-base counication level is fored by a wireless network integrated by a base station and obile hosts. In this level, the base station provides counication services to obile hosts in its cell. The inter-base counication level is fored by a wired network constituted by several base stations. On the other hand, fro a logical point of view, we consider only one counication level. This counication level is fored by the view that obile hosts have during the syste execution. In our work, we propose a protocol that carries out a causal ordering according to the causal view that the obile hosts perceives during the syste execution. In our case, the base stations are in charge of carrying out the causal delivery of essages according to the order in which essages were observed by the obile hosts, thus avoiding the serialization of the essages iplicitly established by the causal view of the base station. The obile host uses a bit vector Φ i, to establish the iediate dependency relation aong essages. The nuber of bit vectors at a obile host is equal to the nuber of base stations involved in syste. In our protocol, each bit vector logically represents the obile host of a cell. The size of Φ i is equal to the nuber of obile hosts that are within the cell of the base station i. A bit of Φ i is equal to 1 if a essage sent by a obile host of the base station i has an iediate dependency relation (definition 2) with the next essage to send. The bit vectors are the only control inforation attached to essages sent in the wireless counication channel
4 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January which deterine the iediate dependency relation between essages. The base stations keep control inforation of essages causally sent in the cellular network. Through this control inforation and the bit vectors attached to essages by the s, the base stations can deterine precedence iediate dependencies between essages sent by s on different BSs. 3.1 Data Structures Each base station has the following data structures: VT(p) is the vector tie. For each obile host p there is an eleent VT(p)[j], where j is a obile host identifier. The size of VT is equal to the nuber of obile hosts in the group. VT(p) contains the local view that a obile host p has of the eleents of the syste. In particular, eleent VT(p)[j] represents the greatest eleent nuber of the identifier j and seen in causal order by p. It is through the VT(p) structure that we are able to guarantee the causal delivery of eleents. A structure to keep control inforation CI(p) of essages sent. The structure CI(p) is a set of entries (k, t, d,, ip). Each entry in CI(p) denotes a essage that is not ensured by participant p of being delivered in a causal order. The entry (k, t, d,, ip) represents a diffusion by participant k at a logical local tieclock t = VT(p)[k], where d is equal to the nuber of essages sent by the base station, is a variable of type tie, and ip is a boolean variable, which is used to indicate if the essage represented by the entry (k, t, d,, ip) iediately precede a received essage. An integer counter sent_essages that is increented each tie a essage is sent by the base station. The structure of a essage sent in the wired counication channels is a quintuplet ( i, t, BS k, data, H()), where i is the obile host identifier, t is the essage identifier, BS k is the base station identifier, data is the inforation in question, and H() is coposed of a set of eleents h r (), H()={ h r (), h s (), h w ()}, where w is equal to the nuber of base stations in the group. Each eleent h r () of H() is fored by a set of entries (k, t), which represent essages that that have an IDR with. Structure H() is created at the oent of diffusion of a essage by a base station. Data structures aintained at the obile host are: An integer counters received_essages, which is increented each tie that a essage is received by the obile host p. A bit vector Φ r, for each base station r in the counication group. The size of Φ r is equal to the nuber of obile hosts that are within the cell of the base station r. The bits put to 1 in Φ r indicate the iediate dependency relation that the transitted essage has with the essages sent by obile hosts in the BS r. For exaple, the bit of Φ r (p)[j] = 1, indicates that a sent essage by obile host j in the cell covered by the base station r iediately precedes the next essage to send by obile host p. The structure of a essage sent in the wireless counication channels has the following for: (i,t,data,received_essages,{φ r (p),φ s (p)...φ w (p)}, where i is the obile host identifier, t is the essage identifier, received_essages is a counter that is increented each tie a essage is received by the obile host i, and Φ r (p),φ s (p)..φ w (p) are bit vectors that logically represent to the obile host of the cells covered by the base stations r, s, and w, respectively. In our work, a essage transitted by a obile host is denoted by i. When a essage i is sent by the base station to local obile hosts, the essage is denoted by i, and a essage i sent by the base station to another base station is denoted by i. 3.2 Specification of the protocol Table 1. Initially 1. /* Data structures aintained at base station p */ 2. VT(p)[j] = 0 " j:1 n. 3. CI(p)[j] Æ " j:1 w 4. IDR_bits(p) /* vector of bits of size n */ 5. IDR_bits(p)[j] = 0 " j: 1 n. 6. /* Data structures aintained at obile host */ 7. Φ r(p)[j] = 0; j = 1 n ; r = 1 w 8. received_essages = 0 /* account of received essages */ let update_ci( H() ) { // update the control inforation at BS 11. For each h r() Î H() 12. " (x,y) Î h r() if ( x i ) then 13. if $ (k,t,d,, ip) Î CI(p) k = x and t y and = 0 then
5 140 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January (k, t, d,, ip) (k, t, d, = current_tie, ip) 15. Endif 16. Endfor 17. For each (k,t,d,,ip) Î CI(p) /* Delete soe entries of CI */ 18. if ( + d() current_tie ) then 19. CI(p) CI(p) / (k,t,d,,ip) 20. Endfor 21. } Table 2. Diffusion of essage by obile host p 1. /* building of essage */ 2. id_essage = id_ essage /* º(i=id_host, t= id_ essage, received_essages, data, {Φ r(p), Φ s(p).φ w(p)}) */ 4. Difussion:send() /*sent of essage to local base station p*/ Table 3 Reception of essage at base station BS k={p i, p j..p n} 1. /* (i, t, received_essages, data,{φ r(p), Φ s(p).φ w(p)})*/ 2. if i Î BS k then 3. if not ( t =VT(p)[i] +1) then 4. wait 5. Else 6. delevery() 7. VT(p)[i] = VT(p)[i] /* bit vectors to atach the sent essage to local obile hosts*/ 9. For each Φ r(p) Î r = s,t, w 10. For all Φ r(p)[j] = = 1; j = 1,2..n 11. if $ (k,t,d,,predecesor) Î CI(p) k = j and d received_essages and predecesor = false then 12. IDR_Bits r(p)[j] = Φ r(p)[j] 13. (k,t,d,, predecesor) (k,t,d,,predecesor=true) 14. else 15. IDR_Bits r(p)[j] = Endif 17. Endfor 18. Endfor 19. ' (i,t =sent_essages+1,data,{idr_bits r(p),idr_bits s(p) IDR_Bits w(p)}) 20. Difussion : send( ) /* sent of essage to local obile hosts */ 21. For each Φ r(p) Î r = s,t, w // foring H() 22. For all Φ r(p)[j] = = 1; j = 1,2..n 23. " (k,t,d,,predecesor) Î CI(p) 24. if (( k = j ) and ( d received_essages))then 25. h r() h r() È ( k, t ) 26. endif 27. Endfor 28. Endfor 29. ( i, t, BS k, datos, H()) 30. Difussion : send( ) /* sent of essage to other 31. Endif /* End of if, line 3 */ 32. Else /* i Ï BS k */ Mobile hosts*/ 33. /* (i, t, BS k,datos, H()) */ 34. if not ( t =VT(p)[i] +1 and " (s,x)î H(): x VT(p)[s] ) then 35. Wait 36. Else 37. delivery() 38. VT(p)[i] = VT(p)[i] /* essage to sent by BS to local obile hosts */ 40. For each h r() Î H() 41. " (x,y) Î h r() 42. if $(k,t,d,, predecesor)î CI(p) x=k and y = t and predecessor=false then 43. IDR_Bits l(p)[k] = (k,t,d,, predecesor) (k,t,d,, predecesor=true) 45. Else 46. IDR_Bits l(p)[k] = endif 48. Endfor 49. ' ( i, t =sent_essages+1,bs, datos, {IDR_Bits r(p), IDR_Bits s(p),. IDR_Bits w(p)}) 50. Difussion : send() /* sent of essage to local obile hosts */ 51. Endif 52. Endif 53. sent_essages= sent_essages update_ci(h() ) 55. CI(p) CI(p) È { (i,t, sent_essages, = 0, predecesor=fase)} Table 4. Reception of essage by obile host p. 1. /* ( i, t, BS k, datos, {IDR_Bits l(p), IDR_Bits l+1 (p),.. IDR_Bits (p)}) */ 2. If not ( t = received_essages + 1) then 3. Wait 4. Else 5. Delivery( ) 6. received_essages = received_essages For each IDR_Bits l(p) Î l = s,u, w 8. For all IDR_Bits l(p)[j] = =1; j = 1,2 n : j i 9. if (Φ l(p)[j] = =1) then 10. Φ l(p)[j] = Endif 12. Endfor 13. Endfor 14. Φ k(p)[i] = Endif
6 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January Scenario Exaple Consider the group of obile hosts g = {h 1, h 2, h 3, h 4 } and the diffusion of essage 3 to other obile hosts, where h 1 and h 2 are present in the cell served by BS 1, and h 3, and h 4 are present in the cell served by BS 2, see figure 3. Before the delivery of 3 to BS 1, CI(BS 1 )=(h 1,1,2,0,false), CI(BS 2 )=(h 1,1,2,0,false), VT(BS 1 )=(1,0,1,0) and VT(BS 2 )= (1,0,1,0). These values are deduced fro our MOCAVI protocol shown in tables 1-4. In figure 3, we show transitted essages during the execution of our MOCAVI protocol. Diffusion of essage 3 by h 2 at BS 1 Lines 2-4, table 2. The value of id_essage is increented by one. The variable id_essage identifies the essage sent by h 2. Diffusion of essage 3 =(h 2,1,2,data,10,00), send( 3 ). Delivery of essage 3 to its local BS 1 Lines 2-31, table 3. Each tie that a BS receives a essage fro a local obile host. The BS only verifies that the received essage satisfies the FIFO delivery condition. In this case, essage 3 =(h 2,1,2,data,Φ 1 =10, Φ 2 =00) satisfies the delivery condition (Line 3) because t=1 and VT(BS 1 )[ h 2 ] = 0. Thus, the condition t=vt(bs 1 )[h 2 ] +1 is satisfied. Now, essage 3 is delivered and the vector is increased by one in VT(BS 1 )[h 2 ], resulting in VT(BS 1 )=(1,1,1,0), lines 6-7. The bit put to 1 in Φ 1 indicates that a essage sent by h 1 served by BS 1 iediately precedes 3. Later on, the BS 1 ust send the essage 3 to its local obile hosts and to the others obile hosts in the base station BS 2, see figure 3. h 2 h 1 BS 1 BS 2 h 3 h Figure 3. A scenario of group counication fored by four obile hosts Lines Sending by BS 1 of essage 3 to the local obile hosts. BS 1 builds the bit vectors attached to 3. In this case, the essage to send is 3 º (i=h 2, t =3, data, IDR_Bits 1 =10, IDR_Bits 2=00). Diffusion of essage 3 by BS 1 to base station BS 2 Lines Sending by BS 1 of essage 3 to base station BS 2. BS 1 identifies the essages that have an iediate dependency relation with 3 through of the bit vectors Φ r received attached to it and the control inforation stored in the structure CI(BS 1 ). In Φ 1 the bit equals to 1 indicates that h 1 has sent a essage that iediately precedes to 3. In order to identify the essage that iediately precedes to 3, BS 1 verifies if an entry (k,t,d) of obile host h 1 already exists in CI(BS 1 ) with a d inor or equal to the variable received_essages of 3. In this case, there is an entry storage at CI(BS 1 ) about h 1 with d =2 and the condition d received_essages is satisfied. This entry is the control inforation of essage 2. Thus, the only control inforation attached to 3 in order to ensure a causal order relates to 2, which is the only essage in an iediate dependency relationship with 3, see figure 3. Therefore, the essage to send by BS 1 to BS 2 is 3 =(h 2,1, BS 1,data, (h 1,1)), Line 29. Diffusion of essage 4 by h 4 at BS 2 Lines 2-4, table 2. The value of id_essage is increented by one. The variable id_essage identifies the essage sent by h 4. Diffusion of essage 4 =(h 4,1,2,data,10,00), send( 4 ). Delivery of essage 4 to its local BS 2 Lines 2-31, table 3. The BS 2 verifies that only the received essage satisfies the FIFO delivery condition. In this case, essage 4 =(h 4,1,2,data,10,00) satisfies the delivery condition (Line 3). Now essage 4 is delivered and the vector is increased by one in VT(BS 2 )[h 4 ], resulting in VT(BS 2 )=(1,1,1,1), Line 6-7. Later on, the BS 2 ust send the essage 4 to its local obile hosts and to base station BS 1. Lines Sending by BS 2 of essage 4 to the local obile hosts. In this case, the essage to send is 4 =(h 4,3,data, IDR_Bits 1 =10, IDR_Bits 2 =00). Diffusion of essage 4 by BS 2 to base station BS 1 Lines In Φ 1 the bit equal to 1 indicates that h 1 has sent a essage that iediately precedes to 4. In order to identify the essage that iediately precedes to 4, BS 1 verifies if an entry (k,t,d) of obile host h 1 already exists in CI(BS 1 ) with a d inor or equal to the variable received_essages of 4. In this case, there is an entry
7 142 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January 2008 storage at CI(BS 2 ) about h 1 with d =2, and d received_essages is satisfied. Thus, the only control inforation attached to 4 in order to ensure a causal order relates to 2, which is the only essage that has an iediate dependency relationship with 3, see figure 3. Line 29, Therefore, the essage to send by BS 2 to BS 1 is 4 =(h 4,1, BS 2,data, (h 1,1)). Line 30, Diffusion of 4, send( 4 ). Delivery of essage 3 to BS 2 Lines 33-55, table 3. Each tie a BS receives a essage fro a obile host within cell different to cover by it. The BS verifies that the received essage satisfies the FIFO and causal delivery condition. In this case, essage 3 =(h 2,1, BS 1,data, (h 1,1)) satisfies both conditions (Line 34) because t=1 and VT(BS 2 )[ h 2 ] = 0, and the conditions t=vt(bs 1 )[h 2 ]+1 and " (s,x)îh():x VT(p)[s] are satisfied. Now essage 3 is delivered and the vector is increased by one in VT(BS 2 )[h 2 ], resulting in VT(BS 2 )=(1,1,1,1). Later on (lines 40-50), the BS 2 ust send essage 3 to its local obile hosts. The essage to send by BS 2 to local obile hosts is 3 =(h 2,4, BS 1,data, 00,00), Line 49. Delivery of essage 3 to obile host h 3 Lines 1-10, table 4. Each tie that a obile host receives a essage, the only verifies that the received essage satisfies the FIFO delivery condition. In this case, essage 3 =(h 2,4, BS 1,data, 00,00) satisfies the delivery condition (Line 3) because t =4 and t = Later on, h 3 updates its bit vectors, Line 2-8. After updating the data structures at h 3, the bit vectors are Φ 1 =01, and Φ 2 =01. In the bit vectors Φ 1 and Φ 2, the bits equals to 1 indicate that last essages received by h 3 were sent by h 2 and h 4, respectively. Diffusion of essage 5 by h 3 at BS 2 Lines 2-4, table 2. The value of id_essage is increented by one, id_essage=2. Line 4, Diffusion of essage 5 =(h 3,2,4,data,01,01), send( 5 ). Delivery of essage 5 to its local BS 2 Lines 2-31, table 3. In this case, essage 5 =(h 3,2,4,data, Φ 1 =01,Φ 2 =01) satisfies the FIFO delivery condition (Line 3). Now essage 5 is delivered, and the vector is increased by one in VT(BS 2 )[h 3 ], resulting in VT(BS 2 )=(1,1,2,1). Later on, the BS 2 ust send essage 5 to its local obile hosts and to base station BS 1. Lines Sending by BS 2 of essage 5 to the local obile hosts. The essage to send is 5 =(h 3,5, BS 2,data,01,01). Line 20, Diffusion of essage 5, send( 5 ). Diffusion of essage 5 by BS 2 to base station BS 1 Lines In Φ 1 and Φ 2 the bits set to 1 indicate that the essages sent 3 and 4 by h 2 and h 4, respectively, iediately precede to 5. Thus, the only control inforation attached to 5 in order to ensure a causal order relates to 3 and 4, which are the only essages that have an iediate dependency relation with 5, see figure 3. Line 29, Therefore, the essage to send by BS 2 to BS 1 is 5 =(h 3,2,BS 2,data,{(h 2,1),(h 4,1)}). Line 30, Diffusion of 5, send( 5 ). Delivery of essage 5 to BS 1 Lines 33-55, table 3. The BS 1 verifies that the received essage satisfies the FIFO and causal delivery condition, Line 34. In this case, essage 5 =(h 3,2,BS 2,data, {(h 2,1), (h 4,1)}) satisfies only the FIFO delivery condition (Line 34) because t=2 and VT(BS 1 )[h 3 ]=1 and the condition t=vt(bs 1 )[h 3 ]+1 is satisfied. Because the essage 4 hasn t been received by obile hosts within the cell covered by BS 1, the causal delivery condition (Line 34, 1 VT(BS 1 )[h 4 ]=0) is not satisfied; therefore, essage 5 cannot be delivered causally and it is delayed (Line 35). Delivery of essage 4 to BS 1 Lines 33-55, table 3. The BS 1 verifies that the received essage satisfies the FIFO and causal delivery condition. In this case, essage 4 =(h 4,1, BS 2,data, (h 1,1)) satisfies both conditions (Line 34). Message 4 is delivered, and the vector is increased by one in VT(BS 1 )[h 4 ], resulting in VT(BS 1 )=(1,1,1,1). Later on, the BS 1 ust send essage 4 to its local obile hosts. The essage to send by BS 1 to local obile hosts is 4 =(h 4,4,BS 2,data,00,00), Line 49. Delivery of essage 4 to obile host h 1 Lines 1-10, table 4. The obile host h 1 updates its bit vectors with the reception of essage 4 =(h 4,1,BS 2,data, 00,00), Lines 2-8. The bit vectors after updating the data structures at h 1 are Φ 1 =01, and Φ 2 =01. Line 10, the variable received_essages is increented by one, received_essages= 4. Delivery of essage 4 to obile host h 2 Lines 1-10, table 4. The bit vectors after updating the data structures at h 2 are Φ 1 =01 and Φ 2 =01. Line 10, The account of received essages is increented by one, received_essages= 4.
8 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January Delivery of essage 5 in causal ordering at BS 1 Lines 33-55, table 3. Finally, the BS 1 after the causal delivery of essage 4 verifies if essage 5 satisfies the causal delivery condition, Line 34. Now, essage 5 =(h 3,2,BS 2,data,{(h 2,1), (h 4,1)}) satisfies the causal delivery condition (Line 34) because essage 4 has been received by obile hosts within the cell covered by BS 1. The causal delivery condition (Line 34, 1 VT(BS 1 )[h 4 ]=1) is satisfied, and therefore essage 5 can be delivered causally (Line 37). Later on, the BS 2 ust send essage 5 to its local obile hosts. The essage to send by BS 1 to local obile hosts is 5 =(h 3,5,data, 01,01), Line Coparisons We copare our algorith versus the related work in two aspects: essage overhead and unnecessary inhibition in the essage delivery (see Table 5). 4.1 Message overhead In order to ensure the causal delivery of essages, all algoriths need to add control inforation to the header of each essage. This control inforation is overhead that will increase the bandwidth used. However, the aount of overhead added to the essages by each one of these algoriths is considerably different. Table 5. Coparison between causal algoriths for cellular networks (where n = nuber of s and =nuber of BSs) Protocol Overhead (wireless network) Overhead (wired network) Counication Unnecessary type delivery inhibition AV-1 0 O(n 2 ) Unicast No AV-2 0 O( 2 ) Unicast Yes AV-3 0 O( 2 * k 2 ) Unicast Yes YHH 0 O(n * ) Unicast Yes Mobi Causal O( å = i 1 li ) O( å = i 1 Hence, the control inforation size attached to essages send over the wired network of the algoriths AV-2, AV-3 [2], YHH [3], and Mobi_Causal [9] is O( 2 ), O( 2 k 2 ), O(n * ), and O( å i = 1 li ) respectively, where k is a predeterined integer paraeter, and l i represents the li ) Unicast NO LH 0 O() Multicast Yes PRS O(n) O(n) Group counication KHC 0 O() Multicast Yes MOCAVI Φ(n) O(s): 1 s n Group counication No No nuber of essages sent by base station i. In these algoriths, each essage is intended for a single destination site (obile host), whereas algoriths LH [4], PRS [8], KHC [5], and our proposed protocol MOCAVI allows a essage to be destined for n sites, see table 5. The lowest essage overhead, O(), is proposed in LH, and KHC [5]. However, these algoriths can unnecessarily delay the delivery of a essage since they preserve the causal ordering at a base station level. In our proposal, the size of control inforation differs fro the intra-base counication level and inter-base level. For the intra-base level, we send a constant overhead of n bits per essage. And for inter-base level (counication aong BSs) is given by the cardinality of H(), which can fluctuate in our case between 1 and n (0 H() n), where n is equal to the nuber of obile hosts in the group. This is because H() only has inforation about the ost recent essages that iediately precede a essage. In the best case, dealing with the serial case, we note that the essage overhead is H() =1, and in the case of concurrent essages, the worst case is H() =n. We notice that in our protocol, as for the inial causal algorith in [11], the likelihood that the worst case will occur approaches zero as the nuber of participants in the group grows. Copared with other works that are exclusively based on vectors clocks [2-9], our worst case denotes for the the constant overhead that ust always be attached per essage. 4.2 Unnecessary delivery inhibition Before we copare the probability of unnecessary delivery inhibition aong all protocols, we illustrate the phenoenon of unnecessary inhibition with an exaple. Consider the exaple shown in figure 4. In this scenario, the obile host h 2 sends essage 1 to its local base station BS 2. After delivering 1, the base station BS 2 sends essage 1 to base station BS 1. Another essage 2 is sent by h 3 to BS 2. After delivering 2, the base station BS 2 sends essage 2 to BS 1. As we can see, 2 has been sent before the delivery of 1 at h 3, and therefore, essages 1 and 2 are concurrent. In this case, essage 2 is received before 1 at BS 1. Soe protocols that carry out a causal ordering at a base station level can inhibit the delivery of 2 until 1 has been delivered to BS 1. This is because the essages are delivered according to the causal view of base station BS 2. For BS 2 essage 1 happened before 2 ( 1 2 ). See figure 4. On the other hand, the protocols that perfor a causal ordering according to the causal view of the obile host avoid the phenoenon of unnecessary inhibition.
9 144 IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.1, January 2008 h 1 BS 1 BS 2 h 2 h 3 concurrents 1 Figure 4. An exaple of unnecessary inhibition. Algorith AV-2 has the highest probability of unnecessary inhibition since it only aintains the causal ordering aong base stations [3], see table 5. AV-3 reduces the probability of unnecessary inhibition by dividing the physical cells in logical cells k and aintaining the causal order aong logical cells. In contrast, algoriths PRS and Mobi_Causal ensure causal ordering explicitly according to s. Hence, inhibition never occurs. However, these protocols have a essage overhead O(n) and O( å i = 1 li ) over the wireless and wired counication channels, respectively, table 5. Another drawback of Mobi_causal is the non bounded growth of inforation control storage on each obile host in order to achieve the causal ordering. In our approach, causal ordering is carried out by base stations in accordance with the causal view that the obile hosts have during the syste execution, avoiding the unnecessary delivery inhibition. Our algorith has a essage overhead of n bits, one bit by each obile host in the counication group. 5. Conclusions 2 Base station point of view 1 2 An efficient causal ordering protocol, MOCAVI, for cellular networks has been presented. MOCAVI perfors the causal ordering according to the causal view that the obile host perceives during the syste execution, eliinating with this the inhibition effect in the essage delivery. MOCAVI aintains a low overhead attached to the transitted essages in the wireless counication channels. Moreover, our protocol is efficient since the aount of coputation perfored by obile hosts is low and the control inforation (overhead) attached to the sent essages in the wired counication channels is dynaically adapted to the behavior of the syste. [3] L. H. Yen, T.L. Huang, and S.Y. Huang, A protocol for causally ordered essage delivery in obile coputing systes, ACM/Baltzer Mobile Networks and Applications, vol. 2, no.4, , [4] C.P. Li and T.L. Huang, A obile support station based causal ulticast algorith in obile coputing environent, Proc. 11 th Int l Conf. info. Networking, vol. 2, 9C-1.1-9C-1.10, [5] K. H. Chi, L.H. Yen, C.C. Tseng, and T.L. Huang, A Causal Multicast Protocol for Cellular networks, IEICE TRANS. INF. & SYST., vol. E83-D. no. 12, ,2000. [6] P. Chandra, and A. Kshekalyani, Causal Multicast in Mobile Networks, Proc. The IEEE Coputer Societyapos 12 th Annual International Syposiu on Volue, Issue, , 4-8 Oct [7] R. Praskash and Mukesh Singhal, Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for obile coputing systes, Wireless Networks, (3): , [8] R. Praskash, M. Raynal.and Mukesh Singhal, An Efficient Causal ordering Algorith for Mobile Coputing Environents, Proceedings of the 16th International Conference on Distributed Coputing Systes, p. 744, [9] C. Benzaid and N. Badache, Mobi_Causal: A protocol for Causal Message Ordering in Mobile Coputing Systes, Mobile coputing and counications Review, vol. 9, 19-28,2005. [10] L. Laport, Tie Clocks and the Ordering of Messages in Distributed Systes, Counications ACM 21(7), pp , [11] S. Poares Hernández, J. Fanchon, K. Drira, The Inediate Dependency Relation: An Optial Way to Ensure Causal Group Counication, annual Review of Scalable Coputing, Vol. 6, Series on Scalable Coputing. Ed. Y.C. Kwong, World Scientific, pp , [12] C. Skawratananond, N. Mittal, and V. K. Garg, A Lightweight Algorith for Causal Message Ordering in Mobile Coputing Systes, In Proc. of 12th ISCA Intl. Conf. on Parallel and Distributed Coputing Systes (PDCS), , Florida, USA, [13] B.R. Badrinath, A. Acharya and T. Iielinsky, Structuring Distributed Algoriths for Mobile Hosts, Conf. on Distributed Coputing Systes, June [14] C.Yi Lin, S. Chi Wang and S. Yen Kuo, An Efficient Tie-Based Checkpointing Protocol for Mobile Coputing Systes over Mobile IP, Mobile Networks and Application, , h References [1] ETSI, European Telecounications Standards institute GSM recoendations. [2] S. Alagar and S. Venkatesan, Causally Ordered Message Delivery in Mobile Systes, In Proc.Workshop on Mobile Coputing Systes and Applications, , 1994.
Energy-Efficient Cellular Communications Powered by Smart Grid Technology
Energy-Efficient Cellular Counications Powered by Sart Grid Technology Itiaz Nasi, Mostafa Zaan Chowdhury, and Md. Syadus Sefat Departent of Electrical and Electronic Engineering Khulna University of Engineering
More informationPower Improvement in 64-Bit Full Adder Using Embedded Technologies Er. Arun Gandhi 1, Dr. Rahul Malhotra 2, Er. Kulbhushan Singla 3
Power Iproveent in 64-Bit Full Adder Using Ebedded Technologies Er. Arun Gandhi 1, Dr. Rahul Malhotra 2, Er. Kulbhushan Singla 3 1 Departent of ECE, GTBKIET, Chhapianwali Malout, Punjab 2 Director, Principal,
More informationCOMPARISON OF TOKEN HOLDING TIME STRATEGIES FOR A STATIC TOKEN PASSING BUS. M.E. Ulug
COMPARISON OF TOKEN HOLDING TIME STRATEGIES FOR A STATIC TOKEN PASSING BUS M.E. Ulug General Electric Corporate Research and Developent Schenectady, New York 1245 ABSTRACT Waiting ties have been calculated
More informationImplementation of Adaptive Viterbi Decoder
Ipleentation of Adaptive Viterbi Decoder Devendra Made #1 VIII Se B.E.(Etrx) K.D.K.College of Engineering, Nagpur, Maharashtra(I) Asst. Prof. R.B. Khule *2 M.Tech V.L.S.I. K.D.K.College of Engineering,
More informationA New Localization and Tracking Algorithm for Wireless Sensor Networks Based on Internet of Things
Sensors & Transducers 203 by IFSA http://www.sensorsportal.co A New Localization and Tracking Algorith for Wireless Sensor Networks Based on Internet of Things, 2 Zhang Feng, Xue Hui-Feng, 2 Zhang Yong-Heng,
More informationIntermediate-Node Initiated Reservation (IIR): A New Signaling Scheme for Wavelength-Routed Networks with Sparse Conversion
Interediate-Node Initiated Reservation IIR): A New Signaling Schee for Wavelength-Routed Networks with Sparse Conversion Kejie Lu, Jason P. Jue, Tiucin Ozugur, Gaoxi Xiao, and Irich Chlatac The Center
More informationTransmit Power and Bit Allocations for OFDM Systems in a Fading Channel
Transit Power and Bit Allocations for OFD Systes in a Fading Channel Jiho Jang *, Kwang Bok Lee, and Yong-Hwan Lee * Sasung Electronics Co. Ltd., Suwon P.O.Box, Suwon-si, Gyeonggi-do 44-74, Korea School
More informationKalman Filtering for NLOS Mitigation and Target Tracking in Indoor Wireless Environment
16 Kalan Filtering for NLOS Mitigation and Target Tracking in Indoor Wireless Environent Chin-Der Wann National Sun Yat-Sen University Taiwan 1. Introduction Kalan filter and its nonlinear extension, extended
More informationPrecise Indoor Localization System For a Mobile Robot Using Auto Calibration Algorithm
Precise Indoor Localization Syste For a Mobile Robot Using Auto Calibration Algorith Sung-Bu Ki, JangMyung Lee, and I.O. Lee : Pusan National University, http://robotics.ee.pusan.ac.r, : Ninety syste Abstract:
More informationModeling Beam forming in Circular Antenna Array with Directional Emitters
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volue 5 Issue 3 ǁ Mar. 2017 ǁ PP.01-05 Modeling Bea foring in Circular Antenna Array
More informationPerformance Analysis of an AMC System with an Iterative V-BLAST Decoding Algorithm
I. J. Counications, Network and Syste Sciences, 008,, 105-06 Published Online May 008 in SciRes (http://www.srpublishing.org/journal/ijcns/). Perforance Analysis of an AMC Syste with an Iterative V-BLAST
More informationOPTIMIZE THE POWER CONTROL AND NETWORK LIFETIME USING ZERO - SUM GAME THEORY FOR WIRELESS SENSOR NETWORKS
OTIMIZE THE OWER CONTROL AND NETWORK LIFETIME USING ZERO - SUM GAME THEORY FOR WIRELESS SENSOR NETWORKS Vinoba.V 1, Chithra.S.M 1 Departent of Matheatics, K.N. Governent Arts college, Tail Nadu,( India.)
More informationInterference Management in LTE Femtocell Systems Using Fractional Frequency Reuse
Interference Manageent in LTE Fetocell Systes Using Fractional Frequency Reuse Poongup Lee and Jitae Shin School of Inforation and Counication Engineering Sungyunwan University, Suwon, 440-746, Korea {poongup,
More informationSECURITY AND BER PERFORMANCE TRADE-OFF IN WIRELESS COMMUNICATION SYSTEMS APPLICATIONS
Latin Aerican Applied Research 39:187-192 (2009) SECURITY AND BER PERFORMANCE TRADE-OFF IN WIRELESS COMMUNICATION SYSTEMS APPLICATIONS L. ARNONE, C. GONZÁLEZ, C. GAYOSO, J. CASTIÑEIRA MOREIRA and M. LIBERATORI
More informationDIRECT MAPPING OVSF-BASED TRANSMISSION SCHEME FOR UNDERWATER ACOUSTIC MULTIMEDIA COMMUNICATION
Journal of Marine Science and Technology, Vol. 18, No. 3, pp. 413-418 (2010) 413 DIRECT MAPPING OVSF-BASED TRANSMISSION SCHEME FOR UNDERWATER ACOUSTIC MULTIMEDIA COMMUNICATION Chin-Feng Lin*, Jiang-Yao
More informationPower Optimal Signaling for Fading Multi-access Channel in Presence of Coding Gap
Power Optial Signaling for Fading Multi-access Channel in Presence of Coding Gap Ankit Sethi, Prasanna Chaporkar, and Abhay Karandikar Abstract In a ulti-access fading channel, dynaic allocation of bandwidth,
More informationSAMPLING PERIOD ASSIGNMENT FOR NETWORKED CONTROL SYSTEMS BASED ON THE PLANT OPERATION MODE
SAMPLING PERIOD ASSIGNMENT FOR NETWORKED CONTROL SYSTEMS BASED ON THE PLANT OPERATION MODE Daniel A. Perez, Ubirajara F. Moreno, Carlos B. Montez, Tito L. M. Santos PGEAS - Prograa de Pós-Graduação e Engenharia
More informationAn orthogonal multi-beam based MIMO scheme. for multi-user wireless systems
An orthogonal ulti-bea based IO schee for ulti-user wireless systes Dong-chan Oh o and Yong-Hwan Lee School of Electrical Engineering and IC, Seoul ational University Kwana P.O. Box 34, Seoul, 151-600,
More informationAnalysis on DV-Hop Algorithm and its variants by considering threshold
Analysis on DV-Hop Algorith and its variants by considering threshold Aanpreet Kaur 1, Pada Kuar 1, Govind P Gupta 2 1 Departent of Coputer Science & Engineering Jaypee Institute of Inforation Technology,
More informationA Novel TDS-FDMA Scheme for Multi-User Uplink Scenarios
A Novel TDS-FDMA Schee for Multi-User Uplink Scenarios Linglong Dai, Zhaocheng Wang, Jun Wang, and Zhixing Yang Tsinghua National Laboratory for Inforation Science and Technology, Electronics Engineering
More informationInvestigating Multiple Alternating Cooperative Broadcasts to Enhance Network Longevity
Investigating Multiple Alternating Cooperative Broadcasts to Enhance Network Longevity Aravind Kailas School of Electrical and Coputer Engineering Georgia Institute of Technology Atlanta, Georgia 3033-050,
More informationComparison Between PLAXIS Output and Neural Network in the Guard Walls
Coparison Between PLAXIS Output and Neural Network in the Guard Walls Ali Mahbod 1, Abdolghafar Ghorbani Pour 2, Abdollah Tabaroei 3, Sina Mokhtar 2 1- Departent of Civil Engineering, Shahid Bahonar University,
More informationPerformance of Multiuser MIMO System Employing Block Diagonalization with Antenna Selection at Mobile Stations
Perforance of Multiuser MIMO Syste Eploying Bloc Diagonalization with Antenna Selection at Mobile Stations Feng Wang, Mare E. Bialowsi School of Inforation Technology and Electrical Engineering The University
More informationContent-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks
Content-Centric Multicast Beaforing in Cache-Enabled Cloud Radio Access Networks Hao Zhou, Meixia Tao, Erkai Chen,WeiYu *Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
More informationPOWER QUALITY ASSESSMENT USING TWO STAGE NONLINEAR ESTIMATION NUMERICAL ALGORITHM
POWER QUALITY ASSESSENT USING TWO STAGE NONLINEAR ESTIATION NUERICAL ALGORITH Vladiir Terzia ABB Gerany vadiir.terzia@de.abb.co Vladiir Stanoevic EPS Yugoslavia vla_sta@hotail.co artin axiini ABB Gerany
More informationDistributed Power Delivery for Energy Efficient and Low Power Systems
Distributed Power Delivery for Energy Efficient and Low Power Systes Selçuk Köse Departent of Electrical Engineering University of South Florida Tapa, Florida 33620 kose@usf.edu Eby G. Friedan Departent
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,900 116,000 10M Open access books available International authors and editors Downloads Our authors
More informationELEC2202 Communications Engineering Laboratory Frequency Modulation (FM)
ELEC Counications Engineering Laboratory ---- Frequency Modulation (FM) 1. Objectives On copletion of this laboratory you will be failiar with: Frequency odulators (FM), Modulation index, Bandwidth, FM
More informationSession Eleven: An On-Line Technique to Detect Winding Deformation within Power Transformers
Session Eleven: An On-Line Technique to Detect Winding Deforation within Power Transforers A. Abu-Siada Senior Lecturer, Curtin University Abstract Frequency Response Analysis (FRA) has been growing in
More informationIMPROVEMENT OF FAR FIELD RADIATION PATTERN OF LINEAR ARRAY ANTENNA USING GENETIC ALGORITHM
ISSN: 2229-6948 (ONLINE) ICTACT JOURNAL OF COMMUNICATION TECHNOLOGY, MARCH 10, VOLUME: 01, ISSUE: 01 DOI: 10.21917/ijct.10.0004 IMPROVEMENT OF FAR FIELD RADIATION PATTERN OF LINEAR ARRAY ANTENNA USING
More informationPREDICTING SOUND LEVELS BEHIND BUILDINGS - HOW MANY REFLECTIONS SHOULD I USE? Apex Acoustics Ltd, Gateshead, UK
PREDICTING SOUND LEVELS BEHIND BUILDINGS - HOW MANY REFLECTIONS SHOULD I USE? W Wei A Cooke J Havie-Clark Apex Acoustics Ltd, Gateshead, UK Apex Acoustics Ltd, Gateshead, UK Apex Acoustics Ltd, Gateshead,
More information4G Communication Resource Analysis with Adaptive Physical Layer Technique
International Journal of Engineering Trends and Technology (IJETT) Volue 33 uber - March 206 4G Counication Resource Analysis with Adaptive Physical Layer Technique Mubinul Haque, Dr. Md. Abu Bakar Siddiqui
More informationSIG: Signal-Processing
TH Köln - Technology, Arts, Sciences Prof. Dr. Rainer Bartz SIG: Signal-Processing Copendiu (6) Prof. Dr.-Ing. Rainer Bartz rainer.bartz@th-koeln.de Contact: eail: website: office: rainer.bartz@th-koeln.de
More informationResearch Article Dynamic Beamforming for Three-Dimensional MIMO Technique in LTE-Advanced Networks
Antennas and Propagation Volue 213, Article ID 76457, 8 pages http://dx.doi.org/1.1155/213/76457 Research Article Dynaic Beaforing for Three-Diensional MIMO Technique in LTE-Advanced Networks Yan Li, Xiaodong
More informationA soft decision decoding of product BCH and Reed-Müller codes for error control and peak-factor reduction in OFDM
A soft decision decoding of product BCH and Reed-Müller codes for error control and pea-factor reduction in OFDM Yves LOUET *, Annic LE GLAUNEC ** and Pierre LERAY ** * PhD Student and ** Professors, Departent
More informationECE 6560 Multirate Signal Processing Analysis & Synthesis Notes
Multirate Signal Processing Analysis & Synthesis Notes Dr. Bradley J. Bazuin Western Michigan University College of Engineering and Applied Sciences Departent of Electrical and Coputer Engineering 1903
More informationUplink blocking probability calculation for cellular systems with WCDMA radio interface and finite source population
Uplin blocing probability calculation for cellular systes with WCDMA radio interface and finite source population Mariusz Głąbowsi *, Macie Stasia *, Aradiusz Wiśniewsi and Piotr Zwierzyowsi * * Institute
More informationA Novel NLOS Mitigation Approach for Wireless Positioning System
2 3rd International Conference on Coputer and Electrical Engineering (ICCEE 2) IPCSIT vol. 53 (22) (22) IACSIT Press, Singapore DOI:.7763/IPCSIT.22.V53.No..54 A Novel NLOS Mitigation Approach for Wireless
More informationOutage Probability of Alamouti based Cooperative Communications with Multiple Relay Nodes using Network Coding
Outage Probability of Alaouti based Cooperative Counications with Multiple Relay Nodes using Network Coding Gordhan Das Menghwar and Christoph F. Mecklenbräuker 2 Inforation Technology Centre Sindh Agriculture
More informationTESTING OF ADCS BY FREQUENCY-DOMAIN ANALYSIS IN MULTI-TONE MODE
THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volue 5, Nuber /004, pp.000-000 TESTING OF ADCS BY FREQUENCY-DOMAIN ANALYSIS IN MULTI-TONE MODE Daniel BELEGA
More informationTransmit Beamforming and Iterative Water-Filling Based on SLNR for OFDMA Systems
Transit Beaforing and Iterative Water-Filling Based on SLNR for OFDMA Systes Kazunori Hayashi, Megui Kaneko, Takeshi Fui, Hideaki Sakai Graduate School of Inforatics, Kyoto University, Yoshida Honachi
More informationAdditive Synthesis, Amplitude Modulation and Frequency Modulation
Additive Synthesis, Aplitude Modulation and Frequency Modulation Pro Eduardo R Miranda Varèse-Gastproessor eduardo.iranda@btinternet.co Electronic Music Studio TU Berlin Institute o Counications Research
More informationExperiment 7: Frequency Modulation and Phase Locked Loops October 11, 2006
Experient 7: Frequency Modulation and Phase ocked oops October 11, 2006 Frequency Modulation Norally, we consider a voltage wave for with a fixed frequency of the for v(t) = V sin(ω c t + θ), (1) where
More informationA Selection Region Based Routing Protocol for Random Mobile ad hoc Networks with Directional Antennas
A Selection Region Based Routing Protocol for Rando Mobile ad hoc Networks with Directional Antennas arxiv:1011.6017v1 cs.it] 8 Nov 010 Di Li, Changchuan Yin, and Changhai Chen Key Laboratory of Universal
More informationDSI3 Sensor to Master Current Threshold Adaptation for Pattern Recognition
International Journal of Signal Processing Systes Vol., No. Deceber 03 DSI3 Sensor to Master Current Threshold Adaptation for Pattern Recognition David Levy Infineon Austria AG, Autootive Power Train Systes,
More informationEvolutionary Computing Based Antenna Array Beamforming with Low Probabality of Intercept Property
World Applied Sciences Journal 23 (): 57-575, 23 ISSN 88-4952 IDOSI Publications, 23 DOI:.5829/idosi.wasj.23.23..89 Evolutionary Coputing Based Antenna Array Beaforing with Low Probabality of Intercept
More informationEvolutionary Computing Based Antenna Array Beamforming with Low Probabality of Intercept Property
World Applied Sciences Journal 23 (): 57-575, 23 ISSN 88-4952 IDOSI Publications, 23 DOI:.5829/idosi.wasj.23.23..89 Evolutionary Coputing Based Antenna Array Beaforing with Low Probabality of Intercept
More informationMitigation of GPS L 2 signal in the H I observation based on NLMS algorithm Zhong Danmei 1, a, Wang zhan 1, a, Cheng zhu 1, a, Huang Da 1, a
2nd International Conference on Electrical, Coputer Engineering and Electronics (ICECEE 25 Mitigation of GPS L 2 signal in the H I observation based on NLMS algorith Zhong Danei, a, Wang zhan, a, Cheng
More informationRadio Resource Management in a Coordinated Cellular Distributed Antenna System By Using Particle Swarm Optimization
Radio Resource Manageent in a Coordinated Cellular Distributed Antenna Syste By Using Particle Swar Optiization Oer Haliloglu (1), Cenk Toker (1), Gurhan Bulu (1), Hali Yanikoeroglu (2) (1) Departent of
More informationKeywords: International Mobile Telecommunication (IMT) Systems, evaluating the usage of frequency bands, evaluation indicators
2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Entropy Method based Evaluation for Spectru Usage Efficiency of International Mobile Telecounication
More informationPacket Loss and Delay Combined Optimization for Satellite Channel Bandwidth Allocation Controls
Packet Loss and Delay obined Optiiation for Satellite hannel Bandwth Allocation ontrols Igor Bisio Meber, IEEE, Mario Marchese Senior Meber, IEEE DIST - Departent of ounication, oputer and Syste Science
More informationInternational Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 3, Issue 9, September 2014
International Journal of Advanced Research in Electronics and Counication Engineering Volue 3, Issue 9, Septeber 2014 High Speed Error Detection and Data Recovery Architecture for Video Testing Applications
More informationSecondary-side-only Simultaneous Power and Efficiency Control in Dynamic Wireless Power Transfer System
069060 Secondary-side-only Siultaneous Power and Efficiency Control in Dynaic Wireless Power Transfer Syste 6 Giorgio ovison ) Daita Kobayashi ) Takehiro Iura ) Yoichi Hori ) ) The University of Tokyo,
More informationOverlapped frequency-time division multiplexing
April 29, 16(2): 8 13 www.sciencedirect.co/science/journal/158885 he Journal of China Universities of Posts and elecounications www.buptjournal.cn/xben Overlapped frequency-tie division ultiplexing JIANG
More informationEFFECTS OF MASKING ANGLE AND MULTIPATH ON GALILEO PERFORMANCES IN DIFFERENT ENVIRONMENTS
1 EFFECTS OF MASKING ANGLE AND MULTIPATH ON GALILEO PERFORMANCES IN DIFFERENT ENVIRONMENTS M. Malicorne*, M. Bousquet**, V. Calettes*** SUPAERO, 1 avenue Edouard Belin BP 43, 3155 Toulouse Cedex, France.
More informationAllocation of Multiple Services in Multi-Access Wireless Systems
Allocation of Multiple Serices in Multi-Access Wireless Systes Anders Furuskär Wireless@KTH, Royal Institute of Technology, Sweden and Ericsson Research anders.furuskar@era.ericsson.se Abstract This paper
More informationRandomized Scheduling Algorithms for Wireless Sensor Networks
Randoized Scheduling Algoriths for Wireless Sensor etworks abhendra Bisnik, eeraj Jaggi Rensselaer Polytechnic Institute Troy, Y 80 bisnin@rpiedu, jaggin@rpiedu I ITRODUCTIO A wireless sensor network WS
More informationYield Enhancement Techniques for 3D Memories by Redundancy Sharing among All Layers
Yield Enhanceent Techniques for 3D Meories by Redundancy Sharing aong All Layers Joohwan Lee, Kihyun Park, and Sungho Kang Three-diensional (3D) eories using through-silicon vias (TSVs) will likely be
More informationPower-Efficient Resource Allocation for MC-NOMA with Statistical Channel State Information
Power-Efficient Resource Allocation for MC-NOMA with Statistical Channel State Inforation Zhiqiang Wei, Derrick Wing Kwan Ng, and Jinhong Yuan School of Electrical Engineering and Telecounications, The
More informationDistributed Resource Allocation for Proportional Fairness in Multi-Band Wireless Systems
Distributed Resource Allocation for Proportional Fairness in Multi-Band Wireless Systes I-Hong Hou CSL and Departent of CS University of Illinois Urbana, IL 61801, USA ihou2@illinois.edu Piyush Gupta Bell
More informationA HIGH POWER FACTOR THREE-PHASE RECTIFIER BASED ON ADAPTIVE CURRENT INJECTION APPLYING BUCK CONVERTER
9th International onference on Power Electronics Motion ontrol - EPE-PEM Košice A HIGH POWER FATOR THREE-PHASE RETIFIER BASE ON AAPTIVE URRENT INJETION APPYING BUK ONVERTER Žarko Ja, Predrag Pejović EE
More informationModel Development for the Wideband Vehicle-to-vehicle 2.4 GHz Channel
Model Developent for the Wideband Vehicle-to-vehicle.4 GHz Channel Guillero Acosta and Mary Ann Ingra School of ECE, Georgia Institute of Technology, Atlanta, GA 333-5, USA gte437k@ail.gatech.edu, ai@ece.gatech.edu
More informationCOMBINED FREQUENCY AND SPATIAL DOMAINS POWER DISTRIBUTION FOR MIMO-OFDM TRANSMISSION
The 8th nnual IEEE International Syposiu on Personal, Indoor and Mobile Radio Counications (PIMRC 07) COMINED FREQUENCY ND SPTIL DOMINS POWER DISTRIUTION FOR MIMO-OFDM TRNSMISSION Wladiir ocquet, Kazunori
More informationDesign and Implementation of Block Based Transpose Form FIR Filter
Design and Ipleentation of Bloc Based Transpose For FIR Filter O. Venata rishna 1, Dr. C. Venata Narasihulu 2, Dr.. Satya Prasad 3 1 (ECE, CVR College of Engineering, Hyderabad, India) 2 (ECE, Geethanjali
More informationOptical fiber beamformer for processing two independent simultaneous RF beams
Optical fiber beaforer for processing two independent siultaneous RF beas M. Jaeger, S. Granieri *, and A. Siahakoun Departent of Physics and Optical Engineering, Rose-Hulan Institute of Technology Terre
More informationPARAMETER OPTIMIZATION OF THE ADAPTIVE MVDR QR-BASED BEAMFORMER FOR JAMMING AND MULTIPATH SUPRESSION IN GPS/GLONASS RECEIVERS
PARAMETER OPTIMIZATION OF THE ADAPTIVE MVDR QR-BASED BEAMFORMER FOR JAMMING AND MULTIPATH SUPRESSION IN GPS/GLONASS RECEIVERS V. Behar 1, Ch. Kabakchiev 2, G. Gaydadjiev 3, G.Kuzanov 4, P. Ganchosov 5
More informationINTERFERENCE avoidance has emerged in the literature
1466 IEEE TANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 8, AUGUST 2007 Interference Avoidance and Multiaccess Vector Channels Diitrie C. Popescu, Senior Meber, IEEE, Otilia Popescu, Meber, IEEE, and Christopher
More informationANALYSIS AND OPTIMIZATION OF SYNTHETIC APERTURE ULTRASOUND IMAGING USING THE EFFECTIVE APERTURE APPROACH. Milen Nikolov, Vera Behar
International Journal "Inforation heories & Applications" Vol. 57 AALYSIS AD OPIMIZAIO OF SYHEIC APEUE ULASOUD IMAGIG USIG HE EFFECIVE APEUE APPOACH Milen ikolov, Vera Behar Abstract: An effective aperture
More informationThe PAPR and Simple PAPR Reduction of the 2D Spreading Based Communication Systems
RADIOENGINEERING, VOL. 9, NO., APRIL 7 The PAPR and Siple PAPR Reduction of the D Spreading Based Counication Systes Jiří BLUMENSTEIN, Zbyněk FEDRA Dept. of Radio Electronics, Brno University of Technology,
More informationOptical Cavity Designs for Interferometric Gravitational Wave Detectors. Pablo Barriga 17 August 2009
Optical Cavity Designs for Interferoetric Gravitational Wave Detectors Pablo Barriga 7 August 9 Assignents.- Assuing a cavity of 4k with an ITM of 934 radius of curvature and an ETM of 45 radius of curvature.
More informationEvaluation of Percentage Capacity Loss on LTE Network Caused by Intermodulation Distortion in a Coexistence Scenario
International Journal of Science and Engineering Investigations vol. 6, issue 62, March 2017 ISSN: 2251-8843 Evaluation of ercentage Capacity Loss on LTE Network Caused by Interodulation Distortion in
More informationBeacon-driven Leader Based Protocol over a GE Channel for MAC Layer Multicast Error Control
I. J. Counications, Network and Syste Sciences, 2008, 2, 05-206 Published Online May 2008 in Scies (http://www.spublishing.org/journal/ijcns/. Beacon-driven Leader Based Protocol over a GE Channel for
More informationARecent report pointed out that in 2014 the amount of data
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, JANUARY 2XX 1 QoS-Aware Energy Efficient Association and Resource Scheduling for HetNets Taewoon Ki and J. Morris Chang, Senior Meber, IEEE Abstract
More informationNINTH INTERNATIONAL CONGRESS ON SOUND AND VIBRATION, ICSV9 PASSIVE CONTROL OF LAUNCH NOISE IN ROCKET PAYLOAD BAYS
first nae & faily nae: Rick Morgans Page nuber: 1 NINTH INTERNATIONAL CONGRESS ON SOUND AND VIBRATION, ICSV9 PASSIVE CONTROL OF LAUNCH NOISE IN ROCKET PAYLOAD BAYS Rick Morgans, Ben Cazzolato, Anthony
More informationES 442 Homework #8 Solutions (Spring 2018 Due April 16, 2018 ) Print out homework and do work on the printed pages.. Problem 1 ASCII Code (20 points)
Hoework 8 NAME olutions E 44 Hoework #8 olutions (pring 018 Due April 16, 018 ) Print out hoework and do work on the printed pages.. Proble 1 ACII Code (0 points) he Aerican tandard Code for Inforation
More informationA State-of-the-Art PMU and MATLAB Based GUI Development towards Power System State Estimation on Real Time Basis
I J E E E International Journal of Electrical, Electronics ISSN No. (Online) : 77-66 and oputer Engineering (): 40-45(0) Special Edition for Best Papers of Michael Faraday IET India Suit-0, MFIIS- State-of-the-rt
More informationACCURATE DISPLACEMENT MEASUREMENT BASED ON THE FREQUENCY VARIATION MONITORING OF ULTRASONIC SIGNALS
XVII IMEKO World Congress Metrology in 3rd Millenniu June 22 27, 2003, Dubrovnik, Croatia ACCURATE DISPLACEMENT MEASUREMENT BASED ON THE FREQUENCY VARIATION MONITORING OF ULTRASONIC SIGNALS Ch. Papageorgiou
More informationOTC Statistics of High- and Low-Frequency Motions of a Moored Tanker. sensitive to lateral loading such as the SAL5 and
OTC 61 78 Statistics of High- and Low-Frequency Motions of a Moored Tanker by J.A..Pinkster, Maritie Research Inst. Netherlands Copyright 1989, Offshore Technology Conference This paper was presented at
More informationKeywords Frequency-domain equalization, antenna diversity, multicode DS-CDMA, frequency-selective fading
Joint Frequency-doain Equalization and Antenna Diversity Cobining for Orthogonal Multicode DS-CDMA Signal Transissions in A Frequency-selective Fading Channel Taeshi ITAGAKI *1 and Fuiyui ADACHI *2 Dept.
More informationDetection of Faults in Power System Using Wavelet Transform and Independent Component Analysis
Detection of Faults in Power Syste Using Wavelet Transfor and Independent Coponent Analysis 1 Prakash K. Ray, 2 B. K. Panigrahi, 2 P. K. Rout 1 Dept. of Electrical and Electronics Engineering, IIIT, Bhubaneswar,
More informationAN OPTIMAL DESIGN PROCESS FOR AN ADEQUATE PRODUCT?
AN OPTIMAL DESIGN PROCESS FOR AN ADEQUATE PRODUCT? P. J. Clarkson University of Cabridge Departent of Engineering e-ail: pjc10@ca.ac.uk Keywords: process odelling, robustness, optiisation Abstract: The
More informationELECTROMAGNETIC COVERAGE CALCULATION IN GIS
ELECTROMAGNETIC COVERAGE CALCULATION IN GIS M. Uit Guusay 1, Alper Sen 1, Uut Bulucu 2, Aktul Kavas 2 1 Yildiz Technical University, Departent of Geodesy and Photograetry Engineering, Besiktas, Istanbul,
More informationDesign and Implementation of Serial Port Ultrasonic Distance Measurement System Based on STC12 Jian Huang
International Conference on Education, Manageent and Coputer Science (ICEMC 2016) Design and Ipleentation of Serial Port Ultrasonic Distance Measureent Syste Based on STC12 Jian Huang Xijing University,
More informationKeywords: Equivalent Instantaneous Inductance, Finite Element, Inrush Current.
Discriination of Inrush fro Fault Currents in Power Transforers Based on Equivalent Instantaneous Inductance Technique Coupled with Finite Eleent Method Downloaded fro ijeee.iust.ac.ir at 5:47 IRST on
More informationStudy and Implementation of Complementary Golay Sequences for PAR reduction in OFDM signals
Study and Ipleentation of Copleentary Golay Sequences for PAR reduction in OFDM signals Abstract In this paper soe results of PAR reduction in OFDM signals and error correction capabilities by using Copleentary
More informationINTERNATIONAL TELECOMMUNICATION UNION
INTERNATIONAL TELECOMMUNICATION UNION ITU-T J.133 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU (07/2002) SERIES J: CABLE NETWORKS AND TRANSMISSION OF TELEVISION, SOUND PROGRAMME AND OTHER MULTIMEDIA
More informationRAKE Receiver. Tommi Heikkilä S Postgraduate Course in Radio Communications, Autumn II.
S-72333 Postgraduate Course in Radio Counications, Autun 2004 1 RAKE Receiver Toi Heikkilä toiheikkila@teliasoneraco Abstract RAKE receiver is used in CDMA-based (Code Division Multiple Access) systes
More informationMOBILE OPTICAL WIRELESS SYSTEM FOR HEALTHCARE CONTINUOUS MONITORING USING IR TECHNOLOGY
31 st August 015. Vol.78. No.3 005-015 JATIT & LLS. All rights reserved. ISSN: 199-8645 www.jatit.org E-ISSN: 1817-3195 MOBILE OPTICAL WIRELESS SYSTEM FOR HEALTHCARE CONTINUOUS MONITORING USING IR TECHNOLOGY
More informationUsing Adaptive Modulation in a LEO Satellite Communication System
Proceedings of the 11th WSEAS International Conference on COMMUNICATIONS, Agios Nikolaos, Crete Island, Greece, July 26-28, 27 255 Using Adaptive Modulation in a LEO Satellite Counication Syste L. HADJ
More informationAvailable online at ScienceDirect. Procedia Technology 24 (2016 )
Available online at www.sciencedirect.co ScienceDirect Procedia Technology 4 (16 ) 834 841 International Conference on Eerging Trends in Engineering, Science and Technology (ICETEST - 15) An Intensity
More informationEfficient Non-linear Changed Mel-filter Bank VAD Algorithm
Matheatical Models and Methods in Modern Science Efficient on-linear Changed Mel-filter Bank VAD Algorith DAMJA VLAJ, ZDRAVKO KAČIČ, MARKO KOS Faculty of Electrical Engineering and Coputer Science University
More informationPath-Loss Estimation for Wireless Cellular Networks Using Okumura/Hata Model
Science Journal of Circuits, Systes and Signal Processing 018; 7(1): 0-7 http://www.sciencepublishinggroup.co/j/cssp doi: 10.11648/j.cssp.0180701.13 ISSN: 36-9065 (Print); ISSN: 36-9073 (Online) Path-Loss
More informationLETTER Adaptive Multi-Stage Parallel Interference Cancellation Receiver for Multi-Rate DS-CDMA System
IEICE TRANS. COMMUN., VOL.E87 B, NO.8 AUGUST 2004 2401 LETTER Adaptive Multi-Stage Parallel Interference Cancellation Receiver for Multi-Rate DS-CDMA Syste Seung Hee HAN a), Student Meber and Jae Hong
More informationPower Comparison of 2D, 3D and 2.5D Interconnect Solutions and Power Optimization of Interposer Interconnects
Power Coparison of 2D, 3D and 2.5D Interconnect Solutions and Power Optiization of Interposer Interconnects M Ataul Kari 1, Paul D. Franzon 2, Anil Kuar 3 1,2 North Carolina State University, 3 SEMATECH
More informationNotes on Orthogonal Frequency Division Multiplexing (OFDM)
Notes on Orthogonal Frequency Division Multiplexing (OFDM). Discrete Fourier ransfor As a reinder, the analytic fors of Fourier and inverse Fourier transfors are X f x t t, f dt x t exp j2 ft dt (.) where
More informationAdaptive Harmonic IIR Notch Filter with Varying Notch Bandwidth and Convergence Factor
Journal of Counication and Coputer (4 484-49 doi:.765/548-779/4.6. D DAVID PUBLISHING Adaptive Haronic IIR Notch Filter with Varying Notch Bandwidth and Convergence Factor Li Tan, Jean Jiang, and Liango
More informationA Wireless Transmission Technique for Remote Monitoring and Recording System on Power Devices by GPRS Network
Proceedings of the 6th WSEAS International Conference on Instruentation, Measureent, Circuits & Systes, Hangzhou, China, April 15-17, 007 13 A Wireless Transission Technique for Reote Monitoring and Recording
More informationDistributed Systems. Clocks, Ordering, and Global Snapshots
Distributed Systems Clocks, Ordering, and Global Snapshots Björn Franke University of Edinburgh Logical clocks Why do we need clocks? To determine when one thing happened before another Can we determine
More informationTrack-Before-Detect for an Active Towed Array Sonar
17-20 Noveber 2013, Victor Harbor, Australia Track-Before-Detect for an Active Towed Array Sonar Han X. Vu (1,2), Sauel J. Davey (1,2), Fiona K. Fletcher (1), Sanjeev Arulapala (1,2), Richard Elle (1)
More informationChapter- 5. Performance Evaluation of Conventional Handoff
Chapter- 5 Performance Evaluation of Conventional Handoff Chapter Overview This chapter immensely compares the different mobile phone technologies (GSM, UMTS and CDMA). It also presents the related results
More information