Staging Absolutism free essay sample

Staging Absolutism The Model for Absolute Royal Authority began with absolute monarchy during the fifteenth century in Europe. The ultimate goal of maintaining power and wealth was the primary focus for the rulers of Spain, France, Italy and Germany. The strategies developed by kings and nobility during this period were successful and as a result, yielded complete authority over the government and the lives of people. It was well noted, upon the succession of kings in France, the country served as a model for absolutist government for other countries to follow. From King Henry IV through King Louis XIV absolute monarchy was challenged by nobility. The intention for King Louis XIV was to rule with sovereignty. Absolutism reached its peak during Louis XIV reign. The king was viewed as a God ordained through his possession of absolute blood right. This view caused for the unconditional acceptance of the King Louis XIV and the successors that he represented (Marc Bloch, 1924-1946). We will write a custom essay sample on Staging Absolutism or any similar topic specifically for you Do Not WasteYour Time HIRE WRITER Only 13.90 / page The king further elaborated intentions through the integration of policies, military and provinces. The reign of King Louis XIV completed the process of consolidating royal authority. As it emerged it was strengthened and reinforced by public displays of royal power to the masses, including the people of France and the rest of the world. Traditional privileges continued to create appearances regionally and within social groups. Nobles were still prevalent with political power and very highly visible as the French Estates General and provincial assemblies. While many nobles still held positions of judges they had the power of a congress to counteract royal edicts from becoming a decree. The Sun King, Louis XIV ruled Europe as Spain had in the 1500’s and his motto was â€Å"none his equal† (Weisner) The primary focus was to rule France with a skill and power unmatched by any other ruler in Europe and this tenacity helped to destroy the feudal monarchy. This newly designed governmental development was revived by building a intrinsic hierarchy for the bureaucracy. While new organs of administration were required there were limits that were inevitable for this idea of royal power. During these periods France also experienced significant population growth and the provinces created caused regional differences. The culture of the French people was vastly different. These issues were no easy tasks for the kings to address and overcome. â€Å"The antiquity of the monarchic institution is reflected in the developed terminology for kingship† to be precise the kings, created a â€Å"Cult of Kingship† to overcome these obstacles. (Chaney) This strong presence of nobility began to cease due to the inspirational writings and the creation of Versailles. According to the writings of Jean Bodin and Jacques Benigne Bossuet the origins of sovereignty were biblical. Bodin suggests laws were put in to place by godly rule. â€Å"The first and principal function of sovereignty is to give laws to the citizens generally and individually, and, it must be added, not necessarily with consent of superiors, equals, or inferiors† Bodin further justifies absolute authority by stating, â€Å"Law, on the other hand, comes forth in one moment at the order of him who has the power to command† Bodin, he uses this passage to justify the difference and effectiveness of custom and that of law. â€Å"Customs proposes neither rewards nor penalty; law carries one or the other.. In other words, it is the final will of the sovereign ruler who is divinely appointed to rule and no advice or guidance from nobility or council is required. Bossuet a well respected priest and confessor for the King himself, Bossuet seemed to worship authority. He believes that God exists and that he shape and governs the course of human affairs. Bousset speaks to Monseigneur Le Dauphin, heir to the French throne. He indicates that the conduct established for absolutism solely comes from God. â€Å"Accordingly we have established by means of scripture that monarchical government comes from God†. In Book III, The Nature of Royal Authority, he states the essential characteristics for royal authority. Royal authority is sacred. God established kings as his ministers and reigns over people through them. Second proposition, the person of the king is sacred. Like God, who is sovereign and sacred and royal authority is designated from him. From scriptures, he quotes â€Å"God has chosen my son Solomon to sit upon the throne of the kingdom of Jehovah over Israel. He further adds from Ecclesiastes â€Å"God gives each people the governor an Israel is manifestly reserved to him†. In the third preposition he writes, that obedience to rulers is necessary so that rulers may have the ability to exercise moral judgment. â€Å"Religion and conscience demand that we obey the prince† â€Å"Therefore submit yourselves to the order established among men for love of God; be subjected to the king as the God†. Louis XIV early on had excursions from St. Germains for outings but, primarily for privacy to be with his mistress. These were the cause for the â€Å"immense buildings he erected† memoirs of court life from the Duke of Saint-Simon, Louis de Rouvroy who had greatly admired Louis VIII and a defender of the older style of kingship. The king expected absolute loyalty from everyone. This lavish display of power, wealth and etiquette was performed by him every day. Royal architects deliberately designed the palace to impart a message to all who entered. Everything that the King engaged in was a ceremony. The waking and dressing for the privilege few who attended to him. His royal bedroom was a cathedral itself richly decorated and paintings with biblical scenes. The painting of Louiv XIV â€Å"Taking Up Personal Government† hanging from the ceiling of the Hall of Mirrors for everyone who enters there to see. This painting is symbolic of his equality to God he has bestowed upon him by the presence of angels and France itself being under his rule. With this painting on the ceiling the king has erased any doubts that he is the final rule of authority only next to God himself. Hyacinthe-Francois-Honoree, Pierre- Andre’ Rigaud, has captured the royal pose of the king. The king’s attire conveyed in this portrait is symbolic of king. This self portrait proudly displays the kings wealth and powwealth and power. His adorned wig, robe, trousers and shoes are made of the finest quality and design for this period. The background of the portraits reveals the richness of drapes and fabrics hanging from beams and his crown displayed prominently next to him. Not a smile on his face but, a image of determination fit for a king. The mask of Apollo, God of Light, is reminicent of how the sun warms and protects the earth. As king, he is also the protector of France and its people. The Garden of Facades, there creatively centered, a sculpture of the King and his angel with cherub divinely displayed as God’s anointed choice. This is the new voice and conduct of government. Another illustration of absolute royalty was the Chateau of Marly, 1724 a portrait by Pierre Denis Martin. No one can overlook the scale of this palace and wonder what it could be compared to. Its architectural design has his residence at the very top, at the palace grounds. The 12 pauvillions representing the months of the year The architectural design and the size of this garden undoubtedly conveyed to anyone that entered absolute royal power of King Louis XIV.

The Freedom Writers Diary Essays

The Freedom Writers Diary Essays The Freedom Writers Diary Essay The Freedom Writers Diary Essay The Freedom Writers Essay- Chloe Taylor How are different cultures represented in Freedom Writers? What values and attitudes do we draw from the film and its background? Cultures are shown and exposed to us in various ways everyday. Different cultures are represented in different ways in the Western Society. In the movie Freedom Writers, we witness this cultural conflict on a first hand basis. Urban youths in Freedom Writers heavily rely on respect to judge others. They also judge based on each other’s cultural back ground. Later in the film, these same teenagers begin to value education and the sense of belonging in school, rather than belonging in gangs. Gangs and groups are a part of the Western Society that we have had to learn to accept in our lives. In the feature film Freedom Writers, we are shown gangs divided up into cultures and cultural backgrounds. This has built up a lot of tension between cultures and attitudes towards other gangs. The scene in which all the students enter room 203 and take seats into their separate corners of the room divided into their certain corners of the room shows the division between students in a real life. We see a long shot of the whole classroom showing its layout and the segregation between gangs. Then multiple mid-shots are shown of the gang itself and its individual members to decipher the multiple gangs, their attitudes towards school and their way of life. Even though the students start their school year with an attitude of ignorance towards other cultures they begin to learn the value of each individual and change their point of view and their gangs and cooperate with their cultures. People may argue that respect is something that has to be earned, it is not automatic. In the 1992 Los Angeles’s race riots, respect was something that was taken for granted, as it was essential for their society. In Freedom Writers, Ms Gruwell demanded respect immediately. Not surprisingly the students refused to give it to her and why should they of, they didn’t know anything about Ms Gruwell. Towards the end of the film we see that Ms Gruwell has gradually gained the respect she wanted from her class. We are shown this in a first hand basis as Andre, a gang member, calls Ms Gruwell ‘Mam’. She takes this as an offence and claims she is not anyone’s mother; Eva soon corrects her and states that it was a ‘sign of respect to you’. This scene is shown to us by a series of close up shots of Andre, Ms Gruwell and Eva. This is purposely done to capture the changing emotion in the characters face. The students of room 203 value Ms Gruwell not only as a teacher and a person and this is reflected in their attitude and behaviour. We all know what racism is and have most likely been subjected to it or witnessed it at one time in our lives. Racism is more prominent in schools and work places although random attacks of racist acts can also be seen in the streets or at public places where the offender and the victim may not even know each other. In the feature film Freedom Writers, every student at Long Beach either dishes out racist comments or receives them. When all of the ‘unteachable’ students get integrated into the same class we see this clash of cultures collide. A racist caricature is drawn of one of the African-American students and the rest of the students find it amusing. Ms Gruwell takes the picture and compares it to the Jews during the holocaust. Erin was greeted with dumb-founded looks only to find out the kids didn’t know what the holocaust was yet they acted out their lives in a similar racist manner. This scene is shown by using close ups of Ms Gruwell and the victim of the caricature, Jamal. We see Ms Gruwell looking horrified and Jamal’s expression looking embarrassed. We are also shown mid-shots of the whole class to show their expressions and they seem amused and proud of themselves. Towards the end of the movie the students do not lash out any forms of racism at one another and instead treat each other as good friends. At the end of Freedom Writers, the students have accepted and value each other as individual people not of their cultural back ground. Ms Gruwell gained the respect she earned from devoting her life to teach these children. During this essay I have explored the movie Freedom Writers and how factors like gangs, respect and racism can have such an impact on peoples lives. It can change peoples values on life and their attitudes and behaviours towards things and that is what we draw from the film.

Business and Corporate Law Essay Example | Topics and Well Written Essays - 1500 words

Business and Corporate Law - Essay Example Both offer and acceptance constitute a part of an agreement, which is in turn an element of a contract. An offer can be defined as an option given by an individual which he has agreed to and would not revoke until a specified set of period (Evans p. 145). In order to facilitate the order of business in the market, the parties involved sign a contract based on mutual consent and understanding. The agreement over the contract, however, relates to the offer and agreement and only on the accumulation of both can a successful agreement be reached. Generally, the offeror begins with decision so as to make an offer, after which he deems necessary to communicate it to the relevant party. Then, the offeree may accept the offer after which it is necessary for him to communicate the acceptance. However, the acceptance occurs formally only when the offeror receives the acceptance. In the middle of such scenarios, there may be many different technicalities, where the offeree may also request to m ake changes in the offer, or may even ask for further information. Other parties may also be involved for smooth disposal of agreement. However, in the context of the issue being discussed, the child or an under-age individual is an offeree, and the author is arguing over the situational contexts where the section 7 could be applied. In the view of the author, the offer must not be made to an under-age individuals in any case, not even when he acts of someone else`s behalf to accept an offer. Thus, in any case, any individual under the age of 18 must not enter into a transaction of sale otherwise banned to him; otherwise it would be breach of the law. Furthermore, prior to understanding the argument, there must be a discussion over the Section 7 of the Children and Young Persons Act of Parliament, which solely focuses on the rules of business regarding the sale of tobacco

Mediation and intercultural communication Essay Example | Topics and Well Written Essays - 250 words

Mediation and intercultural communication - Essay Example is to ensure the best performance of his duties, connected with finding an acceptable agreement between opposing parties. As far as mediation in Saudi Arabia is concerned, completely confidential and satisfactory for both parties resolution of the conflict should be meant, while mediation sphere in this country comprises one of the best professionals in this area. Mediators in Saudi Arabia are divided by the sphere of professional interest: for example, in order to solve dispute concerning employment agreement, it is necessary to contact with mediator in Saudi Arabia, who specializes in labor contracts. Other kinds of disputes, which can be handled by mediators in Saudi Arabia, include consumers, business, divorce etc. Saudi Arabia, being a multicultural country, faces disputes in which representatives of opposing cultural views are involved. Intercultural relations and communication are of the great importance in such cases, as it is tremendously necessary to tolerate opposin g parties in order to come to an agreement, which will satisfy both. In such cases mutual understanding and intercultural communications play an integral part and share each other’s thoughts and views, help to understand other opinions and to come to common solutions. To conclude, mediation in Saudi Arabia is a basic instrument in solving disputes and finding agreements. Intercultural relations and communication make it possible to understand opposing parties and to reach a common goal Seat, K. (2012, March 19). International Mediation Developments – November 2013.International Mediation Developments - November 2013. Retrieved June 21, 2014, from http://www.mediate.com/articles/intlmeddevNo Zemanta, A. (2010, January 11). Virtual Mediation Lab.  Virtual Mediation Lab. Retrieved June 21, 2014, from

BP Oil Marketing Plan(The Gulf of Mexico oil spill) Assignment

BP Oil Marketing Plan(The Gulf of Mexico oil spill) - Assignment Example The paper also suggests a marketing plan that can be adopted by the company to help recover from the ‘marketing disaster’ as well as try to regain its position in the markets. First it is crucial to gain a complete overview of the disaster – ‘Deep Water Horizon’. Overview of Disaster One of the largest marine oil accidents was seen on 20th April 2010. The oil spill went on to flow for a total of three months in the Gulf of Mexico. The explosion claimed eleven lives and injured seventeen people. The oils spill started from the sea floor oil gusher. Methane gas was found to be released from the well with high pressures and this went up into the drill column (Cleveland, 2011). The methane gas expanded on the platform and led to the explosion. The fire was intense and was not doused which led to the Deep Water Horizon to sink after 36 hours. The Deep Water was built in 2001, and was managed by BP in the Gulf of Mexico. The spill as a whole has caused exte nsive damage to the wildlife, as well as marine habitats and also damaged hundreds of miles of sea shore as well. The spill led to the close down of several small businesses in the fishing and tourism industry since tar balls were found to be present in the nets (Cleveland, 2011). ... This provides a date wise record of government and non government estimates. Estimates of Flow Rate of Oil in Spill (Cleveland, 2011) The overall impact of the spill has been intense, and the impact will be felt for years to come. Although in the current times, the main issue being faced is the spill on the sea shore and the dead marine and wildlife, this spill will have a major irreparable damage to the Gulf Stream and can cause global thermoregulation activities as well (Zangari, 2010). The damage has been caused to the environment as well as the company. BP has been faced with a major issue here as due to lack communication. A study concluded, â€Å"Better management of decision-making processes within BP and other companies, better communication within and between BP and its contractors and effective training of key engineering and rig personnel would have prevented the Macondo incident† (Belokas, 2011). Macro Environmental Factors Considering the major impact the spill ha s had on the company and the world as a whole, it is crucial to gain a detailed understanding of the environmental factors that can impact the strategic plans of the company. Here for the macro environmental factors, a SWOT and PESTLE analysis of the company has been developed. This helps gain a clearer idea of factors impacting the company and affecting the ability of the company to regain the position in the US of A markets. SWOT Analysis of BP Strengths: BP is one of the largest oil and Petroleum Company in the world The company has used a wide range of strategies pertaining the marketing of their refined products, trading gas, and also the liquefied natural gas and British Petroleum has grown to become a common household name. Wide spread operations and increasingly

Performance Analysis Of Election Algorithm Computer Science Essay

Performance Analysis Of Election Algorithm Computer Science Essay Distributed systems are the systems consisting of multiple processors that connect through a network to communicate. To manage the communication between different nodes and the exchange of data between them, a leader among them is required. In our project we implement the various Election algorithms for choosing the leader in Distributed Systems thus solving the coordinator election problem. We are also comparing the performance of each of these election algorithms. First we implemented the Election algorithms using the message passing interface(MPI). Then we measured and compared the performance of each of these election algorithms and simulated the results. Finally we modified the distributed leader election algorithm to suit the mobile ad-hoc networks. Key Words: Distributed Systems Election algorithms Unidirectional ring algorithm Lelanns algorithm Chang Roberts algorithm Bidirectional ring Leader election Mobile Adhoc Networks Introduction Distributed system It is a group of processors where the memory or a clock is not shared. Every processor has its own associated memory and the information is exchanged through communication networks. Distributed algorithm A distributed algorithm is an algorithm run on such a distributed system assuming the non-existence of central coordinator in these systems. So these algorithms require one process to act as a coordinator. There is no way to select one of them to be leader if all the processes are alike without different characteristics. One of the processes has to take this special responsibility, no matter which process takes it. This problem in which a leader has to be elected is termed as the coordinator election problem that is how to choose a process among the different processors to make it a central coordinator. Election algorithm An election algorithm is used to solve the coordinator election problem in these distributed systems. Any election algorithm must be a distributed algorithm by the nature of the coordinator election problem. The most important feature in election algorithm is it assumes every process has a Unique ID. It votes a process from among the different processors which can act as the initiator, sequencer and monitor in detecting and solving situations like Deadlock, Mutual Exclusion etc. Thus electing a leader process has become a major issue in wired and ad hoc networks. The goal of election algorithm is to see that when an election begins it ends with all processes by an agreement as who has to be the new coordinator. ELECTION ALGORITHM ON RINGS : A ring is formed by the processes in ring algorithm. In this each process sends only messages to the next process in the ring. It can be classified into two categories Unidirectional Bidirectional The messages are sent only in one direction in unidirectional and in both directions in Bidirectional ring algorithms. To compare the performance of these algorithms, the different criteria taken into consideration are Total number of messages passed Complexity of the messages used Time elapsed by the algorithm 2. Implementation Software We have used the message passing interface (MPI) for implementing our algorithms which are discussed below. It is a standard specification for communication through messages among different processes. It is independent of any language. It is used in parallel computing to write programs for group and point to point communication between nodes. We used the C language to implement the election algorithms. The MPIs routines are directly callable in C. The main MPI calls used in our program are MPI_Init: Before communicating, all instances of the code should call this so as to prepare the MPI implementation for the communications environment. MPI_Finalize: For exiting the communication, this is called by all the instances of the code. MPI_Comm_size: To learn about the number of processors which are using MPI environment to communicate, this routine is called. MPI_Comm_rank: Each of this process assigns an integer to the communicating process. MPI_Send: To send a message to another process, this is called. MPI_Recv: This call allows to receive a message from a process. 3. Unidirectional Ring Algorithms The ring algorithm consists of processes arranged in the form of a ring consisting of a token. The token is passed between processes and the process which has the ring can send a message. The election problem can be implemented using the ring algorithms Lelanns algorithm Chang Roberts algorithm 3.1 LeLanns algorithm In this we assume that all the processes are physically and logically ordered. In LeLanns algorithm whenever the coordinator is lost, the initiator sends a token to the other processes in the ring by adding its id. Nodes cannot initiate any messages once they receive the token. After circulating the token, if the process receives back its id then it is chosen to be the leader since it knows that others cannot become leaders as it knows all the ids of the other processes and it has the least id. The message complexity of LeLanns algorithm is O(N2). ALGORITHM: Step 1: begin Step 2: send the token to neighbours with id of current process as i Step 3: add current process id j and forward to neighbours Step 4: if process P receives back its id then Step 5: leader is P Step 6: else return null Step 7: end Message Complexity: Every initiator sends N messages. So the worst case time complexity is N2. The algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is No.of processes Messages Real time User time System time 5 25 1.195 0.025 0.023 10 100 1.292 0.027 0.024 15 225 1.446 0.030 0.027 20 400 1.551 0.034 0.030 25 625 1.654 0.036 0.030 Table 1: LeLanns algorithm 3.2 Chang Roberts algorithm This is similar to lelanns algorithm but with a little change. When a process receives a token with an id greater than the current process id, it drops that particular token as that process cannot be a leader . Hence it forwards the token with an id less that itself. In this way it saves time by discarding the unwanted messages. The worst case message complexity of Chang Roberts algorithm is O(N2) and the average case message complexity is O(N logN). ALGORITHM: Step 1 : send message with identifier = I to other processes Step 2 : if identifier J of current process > I then send the message to neighbours with identifier I Step 3 : else drop message with identifier I and send the message with identifier J to neighbours Step 4 : continue this process until a particular process receives back a message with its identifier. Step 5: if a process receives a message with its id then process= leader. Step 6: else return null Step 7:end Message Complexity: The best case time complexity is 2N-1. The process with largest id sends N messages and other N-1 processes send one message each. The algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is given in the table 2. No.of processes Messages Real time User time System time 5 9 1.189 0.024 0.023 10 19 1.299 0.027 0.024 15 29 1.412 0.029 0.026 20 39 1.531 0.033 0.028 25 49 1.650 0.036 0.031 Table 2:Robert Changs Best Case Algorithm The worst case time complexity is N(N+1)/2. The process with largest id sends N messages and other N-1 processes send messages from 1à ¢Ã¢â€š ¬Ã‚ ¦N-1. No.of processes Messages Real time User time System time 5 15 1.186 0.024 0.023 10 55 1.301 0.027 0.025 15 120 1.414 0.030 0.027 20 210 2.511 0.034 0.029 25 325 1.654 0.035 0.030 Table 3: Robert Changs Worst Case Algorithm 4. Bidirectional Ring Algorithms 4.1 Leader election algorithm for Bidirectional Ring In these bidirectional ring algorithm messages can be sent or exchanged in any direction. We have used the algorithm mentioned in [2] An improved upperbound for distributed election in bidirectional rings of processors. J.Van Leeumen and R.B Tan. Distributed Computing(1987)2:149-160 for implementing it with the MPI. The name (identifier) of a large processor is contained in the register ID which is maintained by the processor and a (Boolean) register DIR that has a direction on the ring in which there are processors that still have a smaller processor up for election. A smaller candidate which is still alive when the messages( the ones having the name of a Large candidate) are created, have them being sent out in its direction. Processors that begin a chase are known as active, and the left over processors are observant. To get rid of the smaller candidate and force agreement on the larger candidate is the main idea behind a chase. After the current active processors have begun the chase, the observant processors basically relay messages onwards unless they notice an unusual situation on the ring only. As the algorithm proceeds, there are two unusual situations that can arise at the location of an observant processor. They are (i) The processor receives a message of the current phase, say through its left link, that contains a value which is less than the current value in its ID register. The processor turns active, increments its phase number by 1, and initiates a chase with the value its current ID in the direction of the message that was received, i.e., out over its left link. (ii) Two messages of the same phase are received by the processor from opposite directions. The processor turns active, increments its phase number by 1, and initiates a chase with the largest value contained in the two messages in the direction of the smallest. As the algorithm proceeds, several active processors that can arise in a phase rapidly decreases, and at the end a single processor will be left precisely. This processor will be familiar that it receives two messages of the same phase from opposite directions that hold same values and is elected because either it receives a message of the current phase with a value exactly alike to the one it sent out (and stored in its ID register) or it receives two messages of the same phase from opposite directions that hold same values. ALGORITHM [2]: The algorithm describes the actions of an arbitrary processor on a bidirectional ring with half-duplex links as required for electing a leader 1) Initialization a) Let u be the executing processors identification number. Send message to both neighbors and phase number Pnum:=0; b) Wait for corresponding messages and to come in from two neighbors c) Compare u1 and u2 and set ID to max(u1,u2)and Dir to the min(u1,u2) and goto Active state else Observant state. 2) Election A processor performs in either active or observant state. a) Active A processor enters the active state with some value v stored in its ID register and a phase number p. The phase number p is either stored in Pnum or it is an update stored in temporary register. The phase number Pnum is incremented by 1 and a message is sent in Dir direction and goes to observant state. b) Observant In this state a processor receives messages and passes them on, unless an unusual situation is observed that enables it to initiate a new phase. Receive messages from one or both directions. Discard any message received with p less than Pnum. i) If the number of messages left are zero then go to observant state. ii) If the number of messages left is one then { Let the one message received be where necessarily p>=PNUM.} if p=PNUM then v = ID:goto inaugurate; v DIR:= direction from which the message was received; goto active state v > ID:begin goto observant else PNUM = p; ID =:v; DIR:=the direction in which the message was going Send message to direction DIR; goto observant iii) If the number of messages left is one then{Let the two messages received be and ,necessarily from opposite directions and with p>=PNUM} if v1=v2 Pnum := p; goto inaugurate else v1!=v2; ID:-=max(v1,v2); DIR:=the direction of min(v1,v2); goto active 3) Inauguration A transfer to this final phase occurs when the algorithm terminates and the ID register contains the identity of the unique leader. Message complexity: The message complexity of the bidirectional algorithm is 1.44NlogN + O(N). MPI is used implementing the algorithm. The Time and message complexity given by the MPI program is No.of processes Messages Real time User time System time 5 14 1.186 0.024 0.022 10 29 1.302 0.027 0.024 15 44 1.417 0.030 0.026 20 59 1.534 0.033 0.028 25 74 1.661 0.036 0.030 Table 4: Leader election algorithm for Bidirectional Ring 4.2 Leader election algorithm for Mobile Adhoc Networks A mobile ad hoc network is dynamic in nature. It is composed of a set of peer-to-peer nodes, that exchanges the information within the network through some wireless channels directly or through a series of such links. A node is independent to move around as there is no fixed final topology. The nodes move freely in a geographical area and are loosely bounded by the transmission range of these wireless channels. Within its transmission range, a mobile node communicates with a set of nodes thus implying all of them have to be in a network. These set of nodes are also known as the neighbors of the communicating node. The mobile nodes act as intermediary routers to direct the packets between the source and the destination nodes (i.e., the set of neighbors). A node is designated as a leader to coordinate the information that needs to be exchanged among nodes and to be in charge of their data requirements. The identification problem of a leader is termed as the leader election problem. Why do we need to select this leader? When the nodes are set out, they form an adhoc network between them within which the whole communication happens. If the topology of the network changes dynamically, a node may suspend its communication with the previous node, just like in distributed networks. So there has risen a need for a leader so that the maintenance of the network and the clock synchronization within it can be done. Also a new leader has to be chosen every time the members of the group are getting updated while communication is taking place. When the communicating nodes move freely and if they are not within the transmission range of each other, then the wireless network fails . Similarly the formation of wireless links happen only when the nodes which are separated and are too far and to communicate, move within the transmission range of one another. The network topology may change rapidly and unpredictably over time since the nodes are mobile. So developing efficient distributed algorithm for adhoc networks is a challenging work to be done. The largest identity node is chosen to be the leader using minimum wireless messages in this approach. A mobile ad hoc network can be considered as a static network with frequent link or node failures, which can be thought of as a mobile node of an adhoc network going out of reach. To cover all the nodes in the network we use the diameter concept. While distance is described as the shortest path between the nodes, diameter is defined as the longest distance between any two nodes in the network. The number of hops will be the taken for measuring the distance and the assumption is that the network becomes stable after a change happens during leader election process and there are only a limited number of changes in the network. A network having N nodes are considered here. Since the topological changes are considered during the leader election, this algorithm takes more than diameter rounds to terminate. If however, the topological changes are not considered diameter rounds are taken to elect the leader. We have used the algorithm mentioned in [3]An Efficient Leader Election Algorithm for Mobile Adhoc Networks Pradeep Parvathipuram1, Vijay Kumar1, and Gi-Chul Yang2 for implementing it with the MPI. Leader Election Each node propagates its unique identifier to its neighbors and a maximum identifier is elected as a leader in every round. This maximum identifier is propagated in the subsequent rounds. All the rounds need to be synchronized. idlist (i) identifies identifier list for node i, which consists of all the neighbors for node i. Lid(i) =max(idlist(i)) Termination At (rounds >= diameter), for each node i, If all identifiers in idlist are the same(i) the node i stops sending the maximum identifier further and chooses the maximum identifier in the idlist(i) as the leader. The algorithm gets terminated if for each node i the elements in idlist (for each node) are the same. The termination may not be at the final part of the diameter rounds, If all identifiers in the idlist as the leader. ALGORITHM [3]: Each node i in the network has two components a) idlist identifier list b) Lid(i) leader id of node i. 1) Each node say node i transmits its unique identifier in the first round and Lid(i) in the subsequent rounds to their neighbors and all these ids will be stored in idlist. Lid(i) = max (idlist(i)); 2) A unique leader is elected in diameter rounds, if there are no topological changes in the network. The algorithm is modified to incorporate topological changes in between the rounds and below is the description of how the algorithm is modified. Case 1: If a node has no outgoing links then lid(i) = i; Case 2: If a node leaves between the rounds, then the neighbors would know this. Suppose node i leaves the network after round r and let its neighbors be j and k. neighbors of i (i.e. j, k). 1) Delete (ilist, idlist(j k)) // delete ilist from idlist ilist contains the group of identifiers that node i has sent to its neighbors before round r along with i The ilist information is also deleted from all the neighbors of j and k if the ilist identifiers have been propagated in the previous rounds. This process continues until all the nodes in the network are covered. 2) Repeat while (round > = diameter), // Termination condition Compare all the identifiers present in idlist(i) for each node i. If all the identifiers in idlist(i) are equal, node i stops propagating its maximum identifier and elects the maximum identifier as the leader. Case 3: If a new node i joins the network in between the rounds say round r then the neighbors will update its idlist. 1) If neighbors of i say node j is the neighbor for node i. Add (i,idlist(j));The normal algorithm continues (the ids are propagated), nodes keep exchanging the information till diameter rounds. 2) Repeat while (round > = diameter),For all nodes in the network (node j) receives an identifier i at diameter round. IF i is greater than the maximum identifier node j has propagated in the previous round (diameter-1). a) Propagate node i to all the neighbors of j. b) Also propagate the node i information to all the neighbors of neighbors i until the whole network is covered, if the above condition satisfies. Else do not propagate the information to nodes in the network i) Compare all the identifiers present in idlist(i) If all the identifiers in idlist(i) are equal, node i stops propagating its maximum identifier and elects the maximum identifier as the leader. ii) All nodes in the network follow this process and a unique leader is elected connected component. The time taken for the algorithm to elect a leader will be O (diam + Άt) where Άt is the time taken for all the nodes to converge and Άt depends on the topology changes. Message complexity The message complexity of this algorithm depends on the number of rounds. In each round it sends 2N messages if we consider a ring topology as every node has 2 neighbors. So message complexity is 2N* No. of rounds. This algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is No.of processes Messages Real time User time System time 5 30 1.187 0.023 0.022 10 120 1.301 0.026 0.024 15 240 1.421 0.030 0.027 20 440 1.541 0.032 0.029 25 650 1.752 0.037 0.031 Table 5: Leader Election Algorithm for Mobile Adhoc Networks 5. Simulations Message Complexity with respect to number of processes Time No.of Messages Transferred Sno Algorithm N=5 N=10 N=15 N=20 N=25 N=5 N=10 N=15 N=20 N=25 1 LeLanns 1.195 1.292 1.446 1.551 1.654 25 100 225 400 625 2 Chang Roberts 1.189 1.299 1.412 1.531 1.65 9 19 29 39 49 3 Bidirectional Ring 1.186 1.302 1.417 1.534 1.661 14 29 44 59 74 4 MobileAdhoc 1.187 1.301 1.421 1.541 1.752 30 120 240 440 650The message and time complexity of each of these 4 algorithms for different number of processes is implemented in our programs and the results are as shown in table 6. All the above simulations are plotted on the graph so as to analyze the way different algorithms message complexity varies with the number of processes on which it executes. 6. Conclusions Table 6: Simulation ResultsComparing the results, we can conclude that the Lelanns algorithm is the most fundamental algorithm and requires large number of message exchanges among the four algorithms. Changs and Robert algorithm made considerable changes to Lelanns algorithm however in the worst case that algorithm also requires O(N2). For leader election in ring topology these are the two unidirectional algorithms that are to be considered. The bidirectional algorithm requires less messages than the worst case Changs and Roberts algorithm. It requires O(N logN) messages. It takes less time to discover the leader when compared to unidirectional algorithms since the messages are sent in both the directions. The final algorithm is put into effect for mobile adhoc networks and is run in many rounds. The messages complexity depends on number of rounds. It guarantees that there is only one leader at a time but however it handles the partition in the network and requires more number of messages .

girls vs boys in china Essay -- essays research papers

  Ã‚  Ã‚  Ã‚  Ã‚  China had solved one of their population problems, but had unknowingly created another problem from it. Back in 1976, China faced an overpopulation problem. The growth of Chinas population brought a lot of problems to the country and to its people. Some of the problems were from overcrowding and not enough resources like food and jobs to go around for everyone. This was why the government of China enacted the One-Child Policy act in order to prevent over population. The One-Child Policy was a law that allowed a family to only have one child with the incentive of economic and educational advantages to the family that obeyed this law, in many cases disobeying the law would result in a fine.   Ã‚  Ã‚  Ã‚  Ã‚  This leads to my main article, in the Guardian Newspaper, that talks about today’s effects on China from the One-Child Policy. The One-Child Policy had been successful in China’s goal to prevent overpopulation but one of its effects was the unbalanced ratio of boy to girl genders. This plan had worked and for a while and the population was controlled and by 1987, â€Å"the country’s boy-girl ratio was similar to the global average. But because of the One-Child Policy, today’s families have been unintentionally giving birth to more males than females as a result, â€Å"approximately 117 boys to every 100 girls.(1)† The government had not foreseen this problem and in response to this problem, they are now offering the parents cash incentives ...